SymmRef: a flexible refinement method for symmetric multimers

Symmetric protein complexes are abundant in the living cell. Predicting their atomic structure can shed light on the mechanism of many important biological processes. Symmetric docking methods aim to predict the structure of these complexes given the unbound structure of a single monomer, or its model. Symmetry constraints reduce the search-space of these methods and make the prediction easier compared to asymmetric protein-protein docking. However, the challenge of modeling the conformational changes that the monomer might undergo is a major obstacle. In this article, we present SymmRef, a novel method for refinement and reranking of symmetric docking solutions. The method models backbone and side-chain movements and optimizes the rigid-body orientations of the monomers. The backbone movements are modeled by normal modes minimization and the conformations of the side-chains are modeled by selecting optimal rotamers. Since solved structures of symmetric multimers show asymmetric side-chain conformations, we do not use symmetry constraints in the side-chain optimization procedure. The refined models are re-ranked according to an energy score. We tested the method on a benchmark of unbound docking challenges. The results show that the method significantly improves the accuracy and the ranking of symmetric rigid docking solutions. SymmRef is available for download at http:// bioinfo3d.cs.tau.ac.il/SymmRef/download.html.     

Monte Carlo refinement of rigid-body protein docking structures with backbone displacement and side-chain optimization

Structures of hitherto unknown protein complexes can be predicted by docking the solved protein monomers. Here, we present a method to refine initial docking estimates of protein complex structures by a Monte Carlo approach including rigid-body moves and side-chain optimization. The energy function used is comprised of van der Waals, Coulomb, and atomic contact energy terms. During the simulation, we gradually shift from a novel smoothed van der Waals potential, which prevents trapping in local energy minima, to the standard Lennard-Jones potential. Following the simulation, the conformations are clustered to obtain the final predictions. Using only the first 100 decoys generated by a fast Fourier transform (FFT)-based rigid-body docking method, our refinement procedure is able to generate near-native structures (interface RMSD <2.5 A) as first model in 14 of 59 cases in a benchmark set. In most cases, clear binding funnels around the native structure can be observed. The results show the potential of Monte Carlo refinement methods and emphasize their applicability for protein-protein docking.     

Principles of flexible protein-protein docking

Treating flexibility in molecular docking is a major challenge in cell biology research. Here we describe the background and the principles of existing flexible protein-protein docking methods, focusing on the algorithms and their rational. We describe how protein flexibility is treated in different stages of the docking process: in the preprocessing stage, rigid and flexible parts are identified and their possible conformations are modeled. This preprocessing provides information for the subsequent docking and refinement stages. In the docking stage, an ensemble of pre-generated conformations or the identified rigid domains may be docked separately. In the refinement stage, small-scale movements of the backbone and side-chains are modeled and the binding orientation is improved by rigid-body adjustments. For clarity of presentation, we divide the different methods into categories. This should allow the reader to focus on the most suitable method for a particular docking problem.     

The impact of protein flexibility on protein-protein docking

Accounting for protein flexibility in protein-protein docking algorithms is challenging, and most algorithms therefore treat proteins as rigid bodies or permit side-chain motion only. While the consequences are obvious when there are large conformational changes upon binding, the situation is less clear for the modest conformational changes that occur upon formation of most protein-protein complexes. We have therefore studied the impact of local protein flexibility on protein-protein association by means of rigid body and torsion angle dynamics simulation. The binding of barnase and barstar was chosen as a model system for this study, because the complexation of these 2 proteins is well-characterized experimentally, and the conformational changes accompanying binding are modest. On the side-chain level, we show that the orientation of particular residues at the interface (so-called hotspot residues) have a crucial influence on the way contacts are established during docking from short protein separations of approximately 5 A. However, side-chain torsion angle dynamics simulations did not result in satisfactory docking of the proteins when using the unbound protein structures. This can be explained by our observations that, on the backbone level, even small (2 A) local loop deformations affect the dynamics of contact formation upon docking. Complementary shape-based docking calculations confirm this result, which indicates that both side-chain and backbone levels of flexibility influence short-range protein-protein association and should be treated simultaneously for atomic-detail computational docking of proteins.     

pyDock: electrostatics and desolvation for effective scoring of rigid-body protein-protein docking

The accurate scoring of rigid-body docking orientations represents one of the major difficulties in protein-protein docking prediction. Other challenges are the development of faster and more efficient sampling methods and the introduction of receptor and ligand flexibility during simulations. Overall, good discrimination of near-native docking poses from the very early stages of rigid-body protein docking is essential step before applying more costly interface refinement to the correct docking solutions. Here we explore a simple approach to scoring of rigid-body docking poses, which has been implemented in a program called pyDock. The scheme is based on Coulombic electrostatics with distance dependent dielectric constant, and implicit desolvation energy with atomic solvation parameters previously adjusted for rigid-body protein-protein docking. This scoring function is not highly dependent on specific geometry of the docking poses and therefore can be used in rigid-body docking sets generated by a variety of methods. We have tested the procedure in a large benchmark set of 80 unbound docking cases. The method is able to detect a near-native solution from 12,000 docking poses and place it within the 100 lowest-energy docking solutions in 56% of the cases, in a completely unrestricted manner and without any other additional information. More specifically, a near-native solution will lie within the top 20 solutions in 37% of the cases. The simplicity of the approach allows for a better understanding of the physical principles behind protein-protein association, and provides a fast tool for the evaluation of large sets of rigid-body docking poses in search of the near-native orientation.     

Performance and enhancement of the LZerD protein assembly pipeline in CAPRI 38-46

We report the performance of the protein docking prediction pipeline of our group and the results for Critical Assessment of Prediction of Interactions (CAPRI) rounds 38-46. The pipeline integrates programs developed in our group as well as other existing scoring functions. The core of the pipeline is the LZerD protein-protein docking algorithm. If templates of the target complex are not found in PDB, the first step of our docking prediction pipeline is to run LZerD for a query protein pair. Meanwhile, in the case of human group prediction, we survey the literature to find information that can guide the modeling, such as protein-protein interface information. In addition to any literature information and binding residue prediction, generated docking decoys were selected by a rank aggregation of statistical scoring functions. The top 10 decoys were relaxed by a short molecular dynamics simulation before submission to remove atom clashes and improve side-chain conformations. In these CAPRI rounds, our group, particularly the LZerD server, showed robust performance. On the other hand, there are failed cases where some other groups were successful. To understand weaknesses of our pipeline, we analyzed sources of errors for failed targets. Since we noted that structure refinement is a step that needs improvement, we newly performed a comparative study of several refinement approaches. Finally, we show several examples that illustrate successful and unsuccessful cases by our group.     

A soft docking algorithm for predicting the structure of antibody-antigen complexes

An efficient soft docking algorithm is described for predicting the mode of binding between an antibody and its antigen based on the three-dimensional structures of the molecules. The basic tools are the "simplified protein" model and the docking algorithm of Wodak and Janin. The side-chain flexibility of Arg, Lys, Asp, Glu, and Met residues on the protein surface is taken into account. A combined filtering technique is used to select candidate binding modes. After energy minimization, we calculate a scoring function, which includes electrostatic and desolvation energy terms. This procedure was applied to targets 04, 05, and 06 of CAPRI, which are complexes of three different camelid antibody VHH variable domains with pig alpha-amylase. For target 06, two native-like structures with a root-mean-square deviation < 4.0 A relative to the X-ray structure were found within the five top ranking structures. For targets 04 and 05, our procedure produced models where more than half of the antigen residues forming the epitope were correctly predicted, albeit with a wrong VHH domain orientation. Thus, our soft docking algorithm is a promising tool for predicting antibody-antigen recognition.     

Docking analysis of transient complexes: interaction of ferredoxin-NADP+ reductase with ferredoxin and flavodoxin

Ferredoxin (Fd) interacts with ferredoxin-NADP(+) reductase (FNR) to transfer two electrons to the latter, one by one, which will finally be used to reduce NADP(+) to NADPH. The formation of a transient complex between Fd and FNR is required for the electron transfer (ET), and extensive mutational and crystallographic studies have been reported to characterize such protein-protein interaction. However, some aspects of the association mechanism still remain unclear. Moreover, in spite of their structural differences, flavodoxin (Fld) can replace Fd in its function and interact with FNR to transfer electrons with only slightly lower efficiency. Although crystallographic structures for the FNR:Fd association have been reported, experimental structural data for the FNR:Fld interaction are highly elusive. We have modeled here the interactions between FNR and both of its protein partners, Fd and Fld, using surface energy analysis, computational rigid-body docking simulations, and interface side-chain refinement. The results, consistent with previous experimental data, suggest the existence of alternative binding modes in these ET proteins.     

ROSETTALIGAND: protein-small molecule docking with full side-chain flexibility

Protein-small molecule docking algorithms provide a means to model the structure of protein-small molecule complexes in structural detail and play an important role in drug development. In recent years the necessity of simulating protein side-chain flexibility for an accurate prediction of the protein-small molecule interfaces has become apparent, and an increasing number of docking algorithms probe different approaches to include protein flexibility. Here we describe a new method for docking small molecules into protein binding sites employing a Monte Carlo minimization procedure in which the rigid body position and orientation of the small molecule and the protein side-chain conformations are optimized simultaneously. The energy function comprises van der Waals (VDW) interactions, an implicit solvation model, an explicit orientation hydrogen bonding potential, and an electrostatics model. In an evaluation of the scoring function the computed energy correlated with experimental small molecule binding energy with a correlation coefficient of 0.63 across a diverse set of 229 protein- small molecule complexes. The docking method produced lowest energy models with a root mean square deviation (RMSD) smaller than 2 A in 71 out of 100 protein-small molecule crystal structure complexes (self-docking). In cross-docking calculations in which both protein side-chain and small molecule internal degrees of freedom were varied the lowest energy predictions had RMSDs less than 2 A in 14 of 20 test cases.     

Using protein binding site prediction to improve protein docking

Predicting protein interaction interfaces and protein complexes are two important related problems. For interface prediction, there are a number of tools, such as PPI-Pred, PPISP, PINUP, Promate, and SPPIDER, which predict enzyme-inhibitor interfaces with success rates of 23% to 55% and other interfaces with 10% to 28% on a benchmark dataset of 62 complexes. Here, we develop, metaPPI, a meta server for interface prediction. It significantly improves prediction success rates to 70% for enzyme-inhibitor and 44% for other interfaces. As shown with Promate, predicted interfaces can be used to improve protein docking. Here, we follow this idea using the meta server instead of individual predictions. We confirm that filtering with predicted interfaces significantly improves candidate generation in rigid-body docking based on shape complementarity. Finally, we show that the initial ranking of candidate solutions in rigid-body docking can be further improved for the class of enzyme-inhibitor complexes by a geometrical scoring which rewards deep pockets. A web server of metaPPI is available at scoppi.tu-dresden.de/metappi. The source code of our docking algorithm BDOCK is also available at www.biotec.tu-dresden.de/~bhuang/bdock.     

A combination of rescoring and refinement significantly improves protein docking performance

To determine the structures of protein-protein interactions, protein docking is a valuable tool that complements experimental methods to characterize protein complexes. Although protein docking can often produce a near-native solution within a set of global docking predictions, there are sometimes predictions that require refinement to elucidate correct contacts and conformation. Previously, we developed the ZRANK algorithm to rerank initial docking predictions from ZDOCK, a docking program developed by our lab. In this study, we have applied the ZRANK algorithm toward refinement of protein docking models in conjunction with the protein docking program RosettaDock. This was performed by reranking global docking predictions from ZDOCK, performing local side chain and rigid-body refinement using RosettaDock, and selecting the refined model based on ZRANK score. For comparison, we examined using RosettaDock score instead of ZRANK score, and a larger perturbation size for the RosettaDock search, and determined that the larger RosettaDock perturbation size with ZRANK scoring was optimal. This method was validated on a protein-protein docking benchmark. For refining docking benchmark predictions from the newest ZDOCK version, this led to improved structures of top-ranked hits in 20 of 27 cases, and an increase from 23 to 27 cases with hits in the top 20 predictions. Finally, we optimized the ZRANK energy function using refined models, which provides a significant improvement over the original ZRANK energy function. Using this optimized function and the refinement protocol, the numbers of cases with hits ranked at number one increased from 12 to 19 and from 7 to 15 for two different ZDOCK versions. This shows the effective combination of independently developed docking protocols (ZDOCK/ZRANK, and RosettaDock), indicating that using diverse search and scoring functions can improve protein docking results.     

Improved side-chain modeling for protein-protein docking

Success in high-resolution protein-protein docking requires accurate modeling of side-chain conformations at the interface. Most current methods either leave side chains fixed in the conformations observed in the unbound protein structures or allow the side chains to sample a set of discrete rotamer conformations. Here we describe a rapid and efficient method for sampling off-rotamer side-chain conformations by torsion space minimization during protein-protein docking starting from discrete rotamer libraries supplemented with side-chain conformations taken from the unbound structures, and show that the new method improves side-chain modeling and increases the energetic discrimination between good and bad models. Analysis of the distribution of side-chain interaction energies within and between the two protein partners shows that the new method leads to more native-like distributions of interaction energies and that the neglect of side-chain entropy produces a small but measurable increase in the number of residues whose interaction energy cannot compensate for the entropic cost of side-chain freezing at the interface. The power of the method is highlighted by a number of predictions of unprecedented accuracy in the recent CAPRI (Critical Assessment of PRedicted Interactions) blind test of protein-protein docking methods.     

Identification of near-native structures by clustering protein docking conformations

Most state-of-the-art protein-protein docking algorithms use the Fast Fourier Transform (FFT) technique to sample the six-dimensional translational and rotational space. Scoring functions including shape complementarity, electrostatics, and desolvation are usually exploited in ranking the docking conformations. While these rigid-body docking methods provide good performance in bound docking, using unbound structures as input frequently leads to a high number of false positive hits. For the purpose of better selecting correct docking conformations, we structurally cluster the docking decoys generated by four widely-used FFT-based protein-protein docking methods. In all cases, the selection based on cluster size outperforms the ranking based on the inherent scoring function. If we cluster decoys from different servers together, only marginal improvement is obtained in comparison with clustering decoys from the best individual server. A collection of multiple decoy sets of comparable quality will be the key to improve the clustering result from meta-docking servers.     

Binding interface prediction by combining protein–protein docking results

We developed a method called residue contact frequency (RCF), which uses the complex structures generated by the protein–protein docking algorithm ZDOCK to predict interface residues. Unlike interface prediction algorithms that are based on monomers alone, RCF is binding partner specific. We evaluated the performance of RCF using the area under the precision‐recall (PR) curve (AUC) on a large protein docking Benchmark. RCF (AUC = 0.44) performed as well as meta‐PPISP (AUC = 0.43), which is one of the best monomer‐based interface prediction methods. In addition, we test a support vector machine (SVM) to combine RCF with meta‐PPISP and another monomer‐based interface prediction algorithm Evolutionary Trace to further improve the performance. We found that the SVM that combined RCF and meta‐PPISP achieved the best performance (AUC = 0.47). We used RCF to predict the binding interfaces of proteins that can bind to multiple partners and RCF was able to correctly predict interface residues that are unique for the respective binding partners. Furthermore, we found that residues that contributed greatly to binding affinity (hotspot residues) had significantly higher RCF than other residues. Proteins 2014; 82:57–66. © 2013 Wiley Periodicals, Inc.     

OPUS-PSP: an orientation-dependent statistical all-atom potential derived from side-chain packing

Here we report an orientation-dependent statistical all-atom potential derived from side-chain packing, named OPUS-PSP. It features a basis set of 19 rigid-body blocks extracted from the chemical structures of all 20 amino acid residues. The potential is generated from the orientation-specific packing statistics of pairs of those blocks in a non-redundant structural database. The purpose of such an approach is to capture the essential elements of orientation dependence in molecular packing interactions. Tests of OPUS-PSP on commonly used decoy sets demonstrate that it significantly outperforms most of the existing knowledge-based potentials in terms of both its ability to recognize native structures and consistency in achieving high Z-scores across decoy sets. As OPUS-PSP excludes interactions among main-chain atoms, its success highlights the crucial importance of side-chain packing in forming native protein structures. Moreover, OPUS-PSP does not explicitly include solvation terms, and thus the potential should perform well when the solvation effect is difficult to determine, such as in membrane proteins. Overall, OPUS-PSP is a generally applicable potential for protein structure modeling, especially for handling side-chain conformations, one of the most difficult steps in high-accuracy protein structure prediction and refinement.