Multi-LZerD: multiple protein docking for asymmetric complexes

The tertiary structures of protein complexes provide a crucial insight about the molecular mechanisms that regulate their functions and assembly. However, solving protein complex structures by experimental methods is often more difficult than single protein structures. Here, we have developed a novel computational multiple protein docking algorithm, Multi‐LZerD, that builds models of multimeric complexes by effectively reusing pairwise docking predictions of component proteins. A genetic algorithm is applied to explore the conformational space followed by a structure refinement procedure. Benchmark on eleven hetero‐multimeric complexes resulted in near‐native conformations for all but one of them (a root mean square deviation smaller than 2.5Å). We also show that our method copes with unbound docking cases well, outperforming the methodology that can be directly compared with our approach. Multi‐LZerD was able to predict near‐native structures for multimeric complexes of various topologies.Proteins 2012; © 2012 Wiley Periodicals, Inc.     

An iterative knowledge-based scoring function for protein-protein recognition

Using an efficient iterative method, we have developed a distance-dependent knowledge-based scoring function to predict protein-protein interactions. The function, referred to as ITScore-PP, was derived using the crystal structures of a training set of 851 protein-protein dimeric complexes containing true biological interfaces. The key idea of the iterative method for deriving ITScore-PP is to improve the interatomic pair potentials by iteration, until the pair potentials can distinguish true binding modes from decoy modes for the protein-protein complexes in the training set. The iterative method circumvents the challenging reference state problem in deriving knowledge-based potentials. The derived scoring function was used to evaluate the ligand orientations generated by ZDOCK 2.1 and the native ligand structures on a diverse set of 91 protein-protein complexes. For the bound test cases, ITScore-PP yielded a success rate of 98.9% if the top 10 ranked orientations were considered. For the more realistic unbound test cases, the corresponding success rate was 40.7%. Furthermore, for faster orientational sampling purpose, several residue-level knowledge-based scoring functions were also derived following the similar iterative procedure. Among them, the scoring function that uses the side-chain center of mass (SCM) to represent a residue, referred to as ITScore-PP(SCM), showed the best performance and yielded success rates of 71.4% and 30.8% for the bound and unbound cases, respectively, when the top 10 orientations were considered. ITScore-PP was further tested using two other published protein-protein docking decoy sets, the ZDOCK decoy set and the RosettaDock decoy set. In addition to binding mode prediction, the binding scores predicted by ITScore-PP also correlated well with the experimentally determined binding affinities, yielding a correlation coefficient of R = 0.71 on a test set of 74 protein-protein complexes with known affinities. ITScore-PP is computationally efficient. The average run time for ITScore-PP was about 0.03 second per orientation (including optimization) on a personal computer with 3.2 GHz Pentium IV CPU and 3.0 GB RAM. The computational speed of ITScore-PP(SCM) is about an order of magnitude faster than that of ITScore-PP. ITScore-PP and/or ITScore-PP(SCM) can be combined with efficient protein docking software to study protein-protein recognition.     

Optimal docking area: a new method for predicting protein-protein interaction sites

Understanding energetics and mechanism of protein-protein association remains one of the biggest theoretical problems in structural biology. It is assumed that desolvation must play an essential role during the association process, and indeed protein-protein interfaces in obligate complexes have been found to be highly hydrophobic. However, the identification of protein interaction sites from surface analysis of proteins involved in non-obligate protein-protein complexes is more challenging. Here we present Optimal Docking Area (ODA), a new fast and accurate method of analyzing a protein surface in search of areas with favorable energy change when buried upon protein-protein association. The method identifies continuous surface patches with optimal docking desolvation energy based on atomic solvation parameters adjusted for protein-protein docking. The procedure has been validated on the unbound structures of a total of 66 non-homologous proteins involved in non-obligate protein-protein hetero-complexes of known structure. Optimal docking areas with significant low-docking surface energy were found in around half of the proteins. The 'ODA hot spots' detected in X-ray unbound structures were correctly located in the known protein-protein binding sites in 80% of the cases. The role of these low-surface-energy areas during complex formation is discussed. Burial of these regions during protein-protein association may favor the complexed configurations with near-native interfaces but otherwise arbitrary orientations, thus driving the formation of an encounter complex. The patch prediction procedure is freely accessible at http://www.molsoft.com/oda and can be easily scaled up for predictions in structural proteomics.     

Shape complementarity of protein-protein complexes at multiple resolutions

Biological complexes typically exhibit intermolecular interfaces of high shape complementarity. Many computational docking approaches use this surface complementarity as a guide in the search for predicting the structures of protein-protein complexes. Proteins often undergo conformational changes to create a highly complementary interface when associating. These conformational changes are a major cause of failure for automated docking procedures when predicting binding modes between proteins using their unbound conformations. Low resolution surfaces in which high frequency geometric details are omitted have been used to address this problem. These smoothed, or blurred, surfaces are expected to minimize the differences between free and bound structures, especially those that are due to side chain conformations or small backbone deviations. Despite the fact that this approach has been used in many docking protocols, there has yet to be a systematic study of the effects of such surface smoothing on the shape complementarity of the resulting interfaces. Here we investigate this question by computing shape complementarity of a set of 66 protein-protein complexes represented by multiresolution blurred surfaces. Complexed and unbound structures are available for these protein-protein complexes. They are a subset of complexes from a nonredundant docking benchmark selected for rigidity (i.e. the proteins undergo limited conformational changes between their bound and unbound states). In this work, we construct the surfaces by isocontouring a density map obtained by accumulating the densities of Gaussian functions placed at all atom centers of the molecule. The smoothness or resolution is specified by a Gaussian fall-off coefficient, termed "blobbyness." Shape complementarity is quantified using a histogram of the shortest distances between two proteins' surface mesh vertices for both the crystallographic complexes and the complexes built using the protein structures in their unbound conformation. The histograms calculated for the bound complex structures demonstrate that medium resolution smoothing (blobbyness = -0.9) can reproduce about 88% of the shape complementarity of atomic resolution surfaces. Complexes formed from the free component structures show a partial loss of shape complementarity (more overlaps and gaps) with the atomic resolution surfaces. For surfaces smoothed to low resolution (blobbyness = -0.3), we find more consistency of shape complementarity between the complexed and free cases. To further reduce bad contacts without significantly impacting the good contacts we introduce another blurred surface, in which the Gaussian densities of flexible atoms are reduced. From these results we discuss the use of shape complementarity in protein-protein docking.     

Efficient comprehensive scoring of docked protein complexes using probabilistic support vector machines

Biological systems and processes rely on a complex network of molecular interactions. While the association of biological macromolecules is a fundamental biochemical phenomenon crucial for the understanding of complex living systems, protein-protein docking methods aim for the computational prediction of protein complexes from individual subunits. Docking algorithms generally produce large numbers of putative protein complexes with only few of these conformations resembling the native complex structure within an acceptable degree of structural similarity. A major challenge in the field of docking is to extract near-native structure(s) out of the large pool of solutions, the so called scoring or ranking problem. A series of structural, chemical, biological and physical properties are used in this work to classify docked protein-protein complexes. These properties include specialized energy functions, evolutionary relationship, class specific residue interface propensities, gap volume, buried surface area, empiric pair potentials on residue and atom level as well as measures for the tightness of fit. Efficient comprehensive scoring functions have been developed using probabilistic Support Vector Machines in combination with this array of properties on the largest currently available protein-protein docking benchmark. The established classifiers are shown to be specific for certain types of protein-protein complexes and are able to detect near-native complex conformations from large sets of decoys with high sensitivity. Using classification probabilities the ranking of near-native structures was drastically improved, leading to a significant enrichment of near-native complex conformations within the top ranks. It could be shown that the developed schemes outperform five other previously published scoring functions.     

Energy minimization in low-frequency normal modes to efficiently allow for global flexibility during systematic protein-protein docking

Protein-protein association can frequently involve significant backbone conformational changes of the protein partners. A computationally rapid method has been developed that allows to approximately account for global conformational changes during systematic protein-protein docking starting from many thousands of start configurations. The approach employs precalculated collective degrees of freedom as additional variables during protein-protein docking minimization. The global collective degrees of freedom are obtained from normal mode analysis using a Gaussian network model for the protein. Systematic docking searches were performed on 10 test systems that differed in the degree of conformational change associated with complex formation and in the degree of overlap between observed conformational changes and precalculated flexible degrees of freedom. The results indicate that in case of docking searches that minimize the influence of local side chain conformational changes inclusion of global flexibility can significantly improve the agreement of the near-native docking solutions with the corresponding experimental structures. For docking of unbound protein partners in several cases an improved ranking of near native docking solutions was observed. This was achieved at a very modest ( approximately 2-fold) increase of computational demands compared to rigid docking. For several test cases the number of docking solutions close to experiment was also significantly enhanced upon inclusion of soft collective degrees of freedom. This result indicates that inclusion of global flexibility can facilitate in silico protein-protein association such that a greater number of different start configurations results in favorable complex formation.     

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.     

Prediction of interface residues in protein-protein complexes by a consensus neural network method: test against NMR data

The number of structures of protein-protein complexes deposited to the Protein Data Bank is growing rapidly. These structures embed important information for predicting structures of new protein complexes. This motivated us to develop the PPISP method for predicting interface residues in protein-protein complexes. In PPISP, sequence profiles and solvent accessibility of spatially neighboring surface residues were used as input to a neural network. The network was trained on native interface residues collected from the Protein Data Bank. The prediction accuracy at the time was 70% with 47% coverage of native interface residues. Now we have extensively improved PPISP. The training set now consisted of 1156 nonhomologous protein chains. Test on a set of 100 nonhomologous protein chains showed that the prediction accuracy is now increased to 80% with 51% coverage. To solve the problem of over-prediction and under-prediction associated with individual neural network models, we developed a consensus method that combines predictions from multiple models with different levels of accuracy and coverage. Applied on a benchmark set of 68 proteins for protein-protein docking, the consensus approach outperformed the best individual models by 3-8 percentage points in accuracy. To demonstrate the predictive power of cons-PPISP, eight complex-forming proteins with interfaces characterized by NMR were tested. These proteins are nonhomologous to the training set and have a total of 144 interface residues identified by chemical shift perturbation. cons-PPISP predicted 174 interface residues with 69% accuracy and 47% coverage and promises to complement experimental techniques in characterizing protein-protein interfaces. .     

Protein-protein docking benchmark version 3.0

We present version 3.0 of our publicly available protein-protein docking benchmark. This update includes 40 new test cases, representing a 48% increase from Benchmark 2.0. For all of the new cases, the crystal structures of both binding partners are available. As with Benchmark 2.0, Structural Classification of Proteins (Murzin et al., J Mol Biol 1995;247:536-540) was used to remove redundant test cases. The 124 unbound-unbound test cases in Benchmark 3.0 are classified into 88 rigid-body cases, 19 medium-difficulty cases, and 17 difficult cases, based on the degree of conformational change at the interface upon complex formation. In addition to providing the community with more test cases for evaluating docking methods, the expansion of Benchmark 3.0 will facilitate the development of new algorithms that require a large number of training examples. Benchmark 3.0 is available to the public at http://zlab.bu.edu/benchmark.     

Integrating atom-based and residue-based scoring functions for protein-protein docking

Most scoring functions for protein-protein docking algorithms are either atom-based or residue-based, with the former being able to produce higher quality structures and latter more tolerant to conformational changes upon binding. Earlier, we developed the ZRANK algorithm for reranking docking predictions, with a scoring function that contained only atom-based terms. Here we combine ZRANK's atom-based potentials with five residue-based potentials published by other labs, as well as an atom-based potential IFACE that we published after ZRANK. We simultaneously optimized the weights for selected combinations of terms in the scoring function, using decoys generated with the protein-protein docking algorithm ZDOCK. We performed rigorous cross validation of the combinations using 96 test cases from a docking benchmark. Judged by the integrative success rate of making 1000 predictions per complex, addition of IFACE and the best residue-based pair potential reduced the number of cases without a correct prediction by 38 and 27% relative to ZDOCK and ZRANK, respectively. Thus combination of residue-based and atom-based potentials into a scoring function can improve performance for protein-protein docking. The resulting scoring function is called IRAD (integration of residue- and atom-based potentials for docking) and is available at http://zlab.umassmed.edu.     

A knowledge-based forcefield for protein-protein interface design

A distance-dependent knowledge-based potential for protein-protein interactions is derived and tested for application in protein design. Information on residue type specific C(alpha) and C(beta) pair distances is extracted from complex crystal structures in the Protein Data Bank and used in the form of radial distribution functions. The use of only backbone and C(beta) position information allows generation of relative protein-protein orientation poses with minimal sidechain information. Further coarse-graining can be done simply in the same theoretical framework to give potentials for residues of known type interacting with unknown type, as in a one-sided interface design problem. Both interface design via pose generation followed by sidechain repacking and localized protein-protein docking tests are performed on 39 nonredundant antibody-antigen complexes for which crystal structures are available. As reference, Lennard-Jones potentials, unspecific for residue type and biasing toward varying degrees of residue pair separation are used as controls. For interface design, the knowledge-based potentials give the best combination of consistently designable poses, low RMSD to the known structure, and more tightly bound interfaces with no added computational cost. 77% of the poses could be designed to give complexes with negative free energies of binding. Generally, larger interface separation promotes designability, but weakens the binding of the resulting designs. A localized docking test shows that the knowledge-based nature of the potentials improves performance and compares respectably with more sophisticated all-atoms potentials.     

Enhancing systematic protein-protein docking methods using ray casting: application to ATTRACT

Systematic protein-protein docking methods need to evaluate a huge number of different probe configurations, thus leading to high computational cost. We present an efficient filter-ray casting filter (RCF)-that enables a notable speed-up of systematic protein-protein docking. The high efficiency of RCF is the outcome of the following factors: (i) extracting of pockets and protrusions on the surfaces of the proteins using visibilities; (ii) a ray casting method that finds aligned receptor pocket/probe protrusion pairs without explicit similarity computations. The RCF method enables the integration of systematic methods and local shape feature matching methods. To verify the efficiency and the accuracy of RCF, we integrated it with a systematic protein-protein docking approach (ATTRACT) based on a reduced protein representation. The test results show that the integrated docking approach is much faster. At the same time, it ranks the lowest ligand root-mean-square deviation (RMSD) (L_rms) solutions higher when docking enzyme-enzyme inhibitor complexes. Consequently, RCF not only enables much faster execution of systematic docking runs but also improves the qualities of docking predictions.     

Homology-based modeling of 3D structures of protein-protein complexes using alignments of modified sequence profiles

Customary practice in predicting 3D structures of protein-protein complexes is employment of various docking methods when the structures of separate monomers are known a priori. The alternative approach, i.e. the template-based prediction with pure sequence information as a starting point, is still considered as being inferior mostly due to presumption that the pool of available structures of protein-protein complexes, which can serve as putative templates, is not sufficiently large. Recently, however, several labs have developed databases containing thousands of 3D structures of protein-protein complexes, which enable statistically reliable testing of homology-based algorithms. In this paper we report the results on homology-based modeling of 3D structures of protein complexes using alignments of modified sequence profiles. The method, called HOMology-BAsed COmplex Prediction (HOMBACOP), has two distinctive features: (I) extra weight on aligning interfacial residues in the dynamical programming algorithm, and (II) increased gap penalties for the interfacial segments. The method was tested against our recently developed ProtCom database and against the Boston University protein-protein BENCHMARK. In both cases, models generated were compared to the models built on basis of customarily protein structure initiative (PSI)-BLAST sequence alignments. It was found that existence of homologous (by the means of PSI-BLAST) templates (44% of cases) enables both methods to produce models of good quality, with the profiles method outperforming the PSI-BLAST models (with respect to the percentage of correctly predicted residues on the complex interface and fraction of native interfacial contacts). The models were evaluated according to the CAPRI assessment criteria and about two thirds of the models were found to fall into acceptable and medium-quality categories. The same comparison of a larger set of 463 protein complexes showed again that profiles generate better models. We further demonstrate, using our ProtCom database, the suitability of the profile alignment algorithm in detecting remote homologues between query and template sequences, where the PSI-BLAST method fails.     

Protein docking using a genetic algorithm

A genetic algorithm (GA) for protein-protein docking is described, in which the proteins are represented by dot surfaces calculated using the Connolly program. The GA is used to move the surface of one protein relative to the other to locate the area of greatest surface complementarity between the two. Surface dots are deemed complementary if their normals are opposed, their Connolly shape type is complementary, and their hydrogen bonding or hydrophobic potential is fulfilled. Overlap of the protein interiors is penalized. The GA is tested on 34 large protein-protein complexes where one or both proteins has been crystallized separately. Parameters are established for which 30 of the complexes have at least one near-native solution ranked in the top 100. We have also successfully reassembled a 1,400-residue heptamer based on the top-ranking GA solution obtained when docking two bound subunits.     

A protein-specifically adapted scoring function for the reranking of docking solutions

In this work, we developed a protein-specifically adapted scoring function and applied it to the reranking of protein-protein docking solutions generated with a conventional docking program. The approach was validated using experimentally determined structures of the bacterial HPr-protein in complex with four structurally nonhomologous binding partners as an example. A sufficiently large data basis for the generation of protein-specifically adapted pair potentials was generated by modeling all orthologous complexes for each type of interaction resulting in a total of 224 complexes. The parameters for potential generation were systematically varied and resulted in a total of 66,132 different scoring functions that were tested for their ability of successful reranking of 1000 docking solutions generated from modeled structures of the unbound binding partners. Parameters that proved critical for the generation of good scoring functions were the distance cutoff used for the generation of the pair potential, and an additional cutoff that allows a proper weighting of conserved and nonconserved contacts in the interface. Compared to the original scoring function, application of this novel type of scoring functions resulted in a significant accumulation of acceptable docking solutions within the first 10 ranks. Depending on the type of complex investigated one to five acceptable complex geometries are found among the 10 highest-ranked solutions and for three of the four systems tested, an acceptable solution was placed on the first rank.     

Scoring optimisation of unbound protein-protein docking including protein binding site predictions

The prediction of the structure of the protein-protein complex is of great importance to better understand molecular recognition processes. During systematic protein-protein docking, the surface of a protein molecule is scanned for putative binding sites of a partner protein. The possibility to include external data based on either experiments or bioinformatic predictions on putative binding sites during docking has been systematically explored. The external data were included during docking with a coarse-grained protein model and on the basis of force field weights to bias the docking search towards a predicted or known binding region. The approach was tested on a large set of protein partners in unbound conformations. The significant improvement of the docking performance was found if reliable data on the native binding sites were available. This was possible even if data for single key amino acids at a binding interface are included. In case of binding site predictions with limited accuracy, only modest improvement compared with unbiased docking was found. The optimisation of the protocol to bias the search towards predicted binding sites was found to further improve the docking performance resulting in approximately 40% acceptable solutions within the top 10 docking predictions compared with 22% in case of unbiased docking of unbound protein structures.     

Dynamic property is a key determinant for protein-protein interactions

Dynamic property is highly correlated with the biological functions of macromolecules, such as the activity and specificity of enzymes and the allosteric regulation in the signal transduction process. Applications of the dynamic property to protein function researches have been discussed and encouraging progresses have been achieved, for example, in enzyme activity and protein-protein docking studies. However, how the global dynamic property contributes to protein-protein interaction was still unclear. We have studied the dynamic property in protein-protein interactions based on Gaussian Network Model and applied it to classify biological and nonbiological protein-protein complexes in crystal structures. The global motion correlation between residues from the two protomers was found to be remarkably different for biological and nonbiological complexes. This correlation has been used to discriminate biological and nonbiological complexes in crystal and gave a classification rate of 86.9% in the cross-validation test. The innovation of this feature is that it is a global dynamic property which does not rely directly on the interfacial properties of the complex. In addition, the correlation of the global motions was found to be weakly correlated with the dissociation rate constant of protein complexes. We suggest that the dynamic property is a key determinant for protein-protein interaction, which can be used to discriminate native and crystal complexes and potentially be applied in protein-protein dynamic rate constants estimations.     

A structure-based benchmark for protein-protein binding affinity

We have assembled a nonredundant set of 144 protein-protein complexes that have high-resolution structures available for both the complexes and their unbound components, and for which dissociation constants have been measured by biophysical methods. The set is diverse in terms of the biological functions it represents, with complexes that involve G-proteins and receptor extracellular domains, as well as antigen/antibody, enzyme/inhibitor, and enzyme/substrate complexes. It is also diverse in terms of the partners' affinity for each other, with K(d) ranging between 10(-5) and 10(-14) M. Nine pairs of entries represent closely related complexes that have a similar structure, but a very different affinity, each pair comprising a cognate and a noncognate assembly. The unbound structures of the component proteins being available, conformation changes can be assessed. They are significant in most of the complexes, and large movements or disorder-to-order transitions are frequently observed. The set may be used to benchmark biophysical models aiming to relate affinity to structure in protein-protein interactions, taking into account the reactants and the conformation changes that accompany the association reaction, instead of just the final product.