PubMed Health⌕ Search

SEARCH · PubMed Health

Results for “Protein Interaction Mapping”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 361 records · Page 20Linked to original sources

ZDOCK and RDOCK performance in CAPRI rounds 3, 4, and 5.

We present an evaluation of the results of our ZDOCK and RDOCK algorithms in Rounds 3, 4, and 5 of the protein docking challenge CAPRI. ZDOCK is a Fast Fourier Transform (FFT)-based, initial-stage rigid-body docking algorithm, and RDOCK is an energy minimization algorithm for refining and reranking ZDOCK results. Of the 9 targets for which we submitted predictions, we attained at least acceptable accuracy for 7, at least medium accuracy for 6, and high accuracy for 3. These results are evidence that ZDOCK in combination with RDOCK is capable of making accurate predictions on a diverse set of protein complexes.

Algorithms↗

Protein-Protein Docking Benchmark 2.0: an update.

We present a new version of the Protein-Protein Docking Benchmark, reconstructed from the bottom up to include more complexes, particularly focusing on more unbound-unbound test cases. SCOP (Structural Classification of Proteins) was used to assess redundancy between the complexes in this version. The new benchmark consists of 72 unbound-unbound cases, with 52 rigid-body cases, 13 medium-difficulty cases, and 7 high-difficulty cases with substantial conformational change. In addition, we retained 12 antibody-antigen test cases with the antibody structure in the bound form. The new benchmark provides a platform for evaluating the progress of docking methods on a wide variety of targets. The new version of the benchmark is available to the public at http://zlab.bu.edu/benchmark2.

Algorithms↗

Approaching the CAPRI challenge with an efficient geometry-based docking.

The last 3 rounds (3-5) of CAPRI included a wide range of docking targets. Several targets were especially challenging, since they involved large-scale movements and symmetric rearrangement, while others were based on homology models. We have approached the targets with a variety of geometry-based docking algorithms that include rigid docking, symmetric docking, and flexible docking with symmetry constraints. For all but 1 docking target, we were able to submit at least 1 acceptable quality prediction. Here, we detail for each target the prediction methods used and the specific biological data employed, and supply a retrospective analysis of the results. We highlight the advantages of our techniques, which efficiently exploit the geometric shape complementarity properties of the interaction. These enable them to run only few minutes on a standard PC even for flexible docking, thus proving their scalability toward computational genomic scale experiments. We also outline the major required enhancements, such as the introduction of side-chain position refinement and the introduction of flexibility for both docking partners.

Algorithms↗

Geometry-based flexible and symmetric protein docking.

We present a set of geometric docking algorithms for rigid, flexible, and cyclic symmetry docking. The algorithms are highly efficient and have demonstrated very good performance in CAPRI Rounds 3-5. The flexible docking algorithm, FlexDock, is unique in its ability to handle any number of hinges in the flexible molecule, without degradation in run-time performance, as compared to rigid docking. The algorithm for reconstruction of cyclically symmetric complexes successfully assembles multimolecular complexes satisfying C(n) symmetry for any n in a matter of minutes on a desktop PC. Most of the algorithms presented here are available at the Tel Aviv University Structural Bioinformatics Web server (http://bioinfo3d.cs.tau.ac.il/).

Algorithms↗

Data-driven docking: HADDOCK's adventures in CAPRI.

We have shown previously that given high-resolution structures of the unbound molecules, structure determination of protein complexes is possible by including biochemical and/or biophysical data as highly ambiguous distance restraints in a docking approach. We applied this method, implemented in the HADDOCK (High Ambiguity Driven DOCKing) package (Dominguez et al., J Am Chem Soc 2003;125:1731-1737), to the targets in the fourth and fifth rounds of CAPRI. Here we describe our results and analyze them in detail. Special attention is given to the role of flexibility in our docking method and the way in which this improves the docking results. We describe extensions to our approach that were developed as a direct result of our participation in CAPRI. In addition to experimental information, we also included interface residue predictions from PPISP (Protein-Protein Interaction Site Predictor; Zhou and Shan, Proteins 2001;44:336-343), a neural network method. Using HADDOCK we were able to generate acceptable structures for 6 of the 8 targets, and to submit at least 1 acceptable structure for 5 of them. Of these 5 submissions, 3 were of medium quality (Targets 10, 11, and 15) and 2 of high quality (Targets 13 and 14). In all cases, predictions were obtained containing at least 40% of the correct epitope at the interface for both ligand and receptor simultaneously.

Algorithms↗

Performance of the first protein docking server ClusPro in CAPRI rounds 3-5.

To evaluate the current status of the protein-protein docking field, the CAPRI experiment came to life. Researchers are given the receptor and ligand 3-dimensional (3D) coordinates before the cocrystallized complex is published. Human predictions of the complex structure are supposed to be submitted within 3 weeks, whereas the server ClusPro has only 24 h and does not make use of any biochemical information. From the 10 targets analyzed in the second evaluation meeting of CAPRI, ClusPro was able to predict meaningful models for 5 targets using only empirical free energy estimates. For two of the targets, the server predictions were assessed to be among the best in the field. Namely, for Targets 8 and 12, ClusPro predicted the model with the most accurate binding-site interface and the model with the highest percentage of nativelike contacts, among 180 and 230 submissions, respectively. After CAPRI, the server has been further developed to predict oligomeric assemblies, and new tools now allow the user to restrict the search for the complex to specific regions on the protein surface, significantly enhancing the predictive capabilities of the server. The performance of ClusPro in CAPRI Rounds 3-5 suggests that clustering the low free energy (i.e., desolvation and electrostatic energy) conformations of a homogeneous conformational sampling of the binding interface is a fast and reliable procedure to detect protein-protein interactions and eliminate false positives. Not including targets that had a significant structural rearrangement upon binding, the success rate of ClusPro was found to be around 71%.

Algorithms↗

Modeling side-chains using molecular dynamics improve recognition of binding region in CAPRI targets.

The CAPRI-II experiment added an extra level of complexity to the problem of predicting protein-protein interactions by including 5 targets for which participants had to build or complete the 3-dimensional (3D) structure of either the receptor or ligand based on the structure of a close homolog. In this article, we describe how modeling key side-chains using molecular dynamics (MD) in explicit solvent improved the recognition of the binding region of a free energy- based computational docking method. In particular, we show that MD is able to predict with relatively high accuracy the rotamer conformation of the anchor side-chains important for molecular recognition as suggested by Rajamani et al. (Proc Natl Acad Sci USA 2004;101:11287-11292). As expected, the conformations are some of the most common rotamers for the given residue, while latch side-chains that undergo induced fit upon binding are forced into less common conformations. Using these models as starting conformations in conjunction with the rigid-body docking server ClusPro and the flexible docking algorithm SmoothDock, we produced valuable predictions for 6 of the 9 targets in CAPRI-II, missing only the 3 targets that underwent significant structural rearrangements upon binding. We also show that our free energy- based scoring function, consisting of the sum of van der Waals, Coulombic electrostatic with a distance-dependent dielectric, and desolvation free energy successfully discriminates the nativelike conformation of our submitted predictions. The latter emphasizes the critical role that thermodynamics plays on our methodology, and validates the generality of the algorithm to predict protein interactions.

Algorithms↗

ATTRACT: protein-protein docking in CAPRI using a reduced protein model.

Protein-protein complex structures have been predicted for CAPRI Rounds 3 and 5 using a reduced protein model. Proteins are represented by up to 3 pseudoatoms per amino acid. The docking approach termed ATTRACT is based on energy minimization in translational and rotational degrees of freedom of one protein with respect to another protein. The reduced protein model allows one to perform systematic docking minimization of many thousand start structures in reasonable computer time. Flexibility of critical surface side-chains can be accounted for by a multiple conformational copy approach. The multicopy approach allows simultaneous adjustment of side-chain conformations and optimization of translational and rotational degrees of freedom of one protein with respect to the partner during docking. For 3 (Targets 8, 14, and 19) out of 5 CAPRI targets, the approach resulted in predictions in close agreement with experiment [root-mean-square deviation (RMSD) of backbone atoms within 10 A of the protein-protein interface < 1.8 A]. The comparison of predicted and experimental structures of the CAPRI targets indicates that besides local conformational changes (e.g., changes in side-chain conformations), global conformational changes of the protein backbone can be critical for complex formation. These conformational changes not accounted for during docking are a likely reason for the unrealistic predictions in 2 cases (Targets 9 and 18).

Algorithms↗

Study of protein-protein interaction using conformational space annealing.

We apply conformational space annealing (CSA), an efficient global optimization method, to the study of protein-protein interaction. The CSA is incorporated into the Tinker molecular modeling package along with a B-spline method for CAPRI Round 5 experiments. We have used an energy function for the protein-protein interaction that consists of electrostatic interaction, van der Waals interaction, and solvation energy terms represented by the occupancy desolvation method. The parameters of the AMBER94 all-atom empirical force field are used. Each energy term is calculated by precalculated grid potentials and B-spline method approximation. The ligand protein is placed inside a sphere of 50 A radius centered at an appropriate location, and the CSA rigid docking studies are carried out to find stable complexes. Up to 10 complexes are selected using the K-mean clustering method and biological information when available. These complexes are energy-minimized for further refinement by considering the flexibility of interacting proteins. The results show that the CSA method has a potential for the study of protein-protein interaction.

Algorithms↗

Incorporation of flexibility into rigid-body docking: applications in rounds 3-5 of CAPRI.

We have submitted models for all 9 targets in Rounds 3-5 of CAPRI and have predicted at least 30% of the correct contacts for 4 of the targets and at least 10% of the correct contacts for another 4 targets. We have employed a variety of techniques but have had the greatest success by combining established rigid-body docking with a variety of initial conformations generated by molecular dynamics.

Algorithms↗

Docking essential dynamics eigenstructures.

This article describes our attempts to dock the targets in CAPRI Rounds 3-5 using Hex 4.2, and it introduces a novel essential dynamics approach to generate multiple feasible conformations for docking. In the blind trial, the basic Hex algorithm found 1 high-accuracy solution for CAPRI Target 12, and several further medium- and low-accuracy solutions for Targets 11, 12, 13, and 14. Subsequent a posteriori docking of the targets using essential dynamics "eigenstructures" was found to give consistently better predictions than rigidly docking only the unbound or model-built starting structures. Some suggestions to improve this promising new approach are presented.

Algorithms↗

Scoring docking models with evolutionary information.

We have developed methods for the extraction of evolutionary information from multiple sequence alignments for use in the study of the evolution of protein interaction networks and in the prediction of protein interaction. For Rounds 3, 4, and 5 of the CAPRI experiment, we used scores derived from the analysis of multiple sequence alignments to submit predictions for 7 of the 12 targets. Our docking models were generated with Hex and GRAMM, but all our predictions were selected using methods based on multiple sequence alignments and on the available experimental evidence. With this approach, we were able to predict acceptable level models for 4 of the targets, and for a fifth target, we located the residues involved in the binding surface. Here we detail our successes and highlight several of the limitations and problems that we faced while dealing with particular docking cases.

Algorithms↗

Protein-protein docking using 3D-Dock in rounds 3, 4, and 5 of CAPRI.

In rounds 3-5 of CAPRI, the community-wide experiment on the comparative evaluation of protein-protein docking for structure prediction, we applied the 3D-Dock software package to predict the atomic structures of nine biophysical interactions. This approach starts with an initial grid-based shape complementarity search. The product of this is a large number of potential interacting conformations that are subsequently ranked by interface residue propensities and interaction energies. Refinement through detailed energetics and optimization of side-chain positions using a rotamer library is also performed. For rounds 3, 4, and 5 of the CAPRI evaluation, where possible, we clustered functional residues on the surfaces of the monomers as an indication of binding sites, using sequence based evolutionary conservations. In certain targets this provided a very useful tool for identifying the areas of interaction. During round 5, we also applied the techniques of side-chain trimming and geometrical clustering described in the literature. Of the nine target complexes in rounds 3-5, we predicted conformations that contained at least some correct contact residues for seven of these systems. For two of the targets, we submitted predictions that were considered as medium-quality. These were a nidogen-laminin complex for target 8 (T08) and a serine-threonine phosphatase bound to a targeting subunit (T14). For a further three target systems, we produced models that were rated as acceptable predictions.

Algorithms↗

Searching for protein-protein interaction sites and docking by the methods of molecular dynamics, grid scoring, and the pairwise interaction potential of amino acid residues.

In CAPRI Rounds 1 and 2, we assumed that because there are many ionic charges that weaken electrostatic interaction forces in living cells, the hydrophobic interaction force might be important entropically. As a result of Rounds 1 and 2, the predictions for binding sites and geometric centers were acceptable, but those of the binding axes were poor, because only the largest benzene cluster was used for generating the initial docking structures. These were generated by fitting of benzene clusters formed on the surface of receptor and ligand. In CAPRI Rounds 3-5, the grid-scoring sum on the protein-protein interaction surface and the pairwise potential of the amino acid residues, which were indicated as coming easily into the protein-protein interaction regions, were used as the calculation methods, along with the smaller benzene clusters that participated in benzene cluster fitting. Good predicted models were obtained for Targets 11 and 12. When the modeled receptor proteins were superimposed on the experimental structures, the smallest ligand root-mean-square deviation (RMSD) values corresponding to the RMSD between the model and experimental structures were 6.2 A and 7.3 A, respectively.

Algorithms↗

Development and testing of an automated approach to protein docking.

A new version of GRAMM was applied to Targets 14, 18, and 19 in CAPRI Round 5. The predictions were generated without manual intervention. Ten top-ranked matches for each target were submitted. The docking was performed by a rigid-body procedure with a smoothed potential function to accommodate conformational changes. The first stage was a global search on a fine grid with a projection of a smoothed Lennard-Jones potential. The top predictions from the first stage were subjected to the conjugate gradient minimization with the same smoothed potential. The resulting local minima were reranked according to the weighted sum of Lennard-Jones potential, pairwise residue-residue statistical preferences, cluster occupancy, and the degree of the evolutionary conservation of the predicted interface. For Targets 14 and 18, the conformation of the complex was predicted with root-mean-square deviation (RMSD) of the ligand interface atoms 0.68 A and 1.88 A correspondingly. For Target 19, the interface areas on both proteins were correctly predicted. The performance of the procedure was also analyzed on the benchmark of bound-unbound protein complexes. The results show that, on average, conformations of only 3 side-chains need to be optimized during docking of unbound structures before the backbone changes become a limiting factor. The GRAMM-X docking server is available for public use at http://www.bioinformatics.ku.edu.

Algorithms↗

Progress in computation and amide hydrogen exchange for prediction of protein-protein complexes.

The macromolecular docking problem that must be solved for experimental biologists is prediction of the structures of complexes for which the components are known or reliably modeled in the unbound state, but the structure of the complex is unknown. The current state of the art in macromolecular docking is such that solving this problem usually requires supplementary experimental chemical and/or biological information to evaluate computational predictions. Amide (1)H/(2)H exchange measured by mass spectroscopy is a promising approach for obtaining such information, because it can reveal interfacial regions of each member of the complex and identify regions of conformational flexibility in the structure. In a previous article (Anand et al., Proc Natl Acad Sci USA 2003;100:13264-13269), we used (1)H/(2)H exchange data to predict the structure of a complex between regulatory and catalytic subunits of protein kinase A. Comparison of the prediction with a recent crystal structure determination (Kim et al., Science 2005;307:690-696) showed large conformational change in the regulatory subunit on formation of the complex. Analysis of the prediction, previous CAPRI results, novel data processing methods for the (1)H/(2)H exchange data, and new fragment docking computations give grounds for cautious optimism that this method can be useful even in cases of substantial conformational change.

Algorithms↗

Improving CAPRI predictions: optimized desolvation for rigid-body docking.

The ICM Docking and Interface Side-Chain Optimization (ICM-DISCO) showed promising predictive results during the first CAPRI experiment by successfully finding medium- or high-accuracy models in 3 of the 7 targets. A key factor was the ability to recognize near-native rigid-body geometries in a relatively low number of alternative docking poses, together with the successful refinement of the rigid-body docking interfaces. Since then, we have focused on improving the scoring function to optimally discriminate the near-native rigid-body conformations. For that, we have defined a new desolvation descriptor for rigid-body docking, based on atomic solvation parameters (ASPs) derived from octanol-water transfer experiments. This and other new approaches have been gradually incorporated into our docking procedure during our participation on the second CAPRI experiment. Overall, we produced reasonable models for 8 of the 9 official targets. Especially encouraging were those cases in which a homology model of 1 of the subunits had to be used during the docking simulations. And not less gratifying has been the successful prediction of antibody-antigen targets in a completely automatic, unrestrained fashion. In summary, our success rate (89%) shows a consistent improvement over the previous CAPRI rounds, and suggests that a correct desolvation description is key for improved protein-protein docking predictions.

Algorithms↗

Docking prediction using biological information, ZDOCK sampling technique, and clustering guided by the DFIRE statistical energy function.

We entered the CAPRI experiment during the middle of Round 4 and have submitted predictions for all 6 targets released since then. We used the following procedures for docking prediction: (1) the identification of possible binding region(s) of a target based on known biological information, (2) rigid-body sampling around the binding region(s) by using the docking program ZDOCK, (3) ranking of the sampled complex conformations by employing the DFIRE-based statistical energy function, (4) clustering based on pairwise root-mean-square distance and the DFIRE energy, and (5) manual inspection and relaxation of the side-chain conformations of the top-ranked structures by geometric constraint. Reasonable predictions were made for 4 of the 6 targets. The best fraction of native contacts within the top 10 models are 89.1% for Target 12, 54.3% for Target 13, 29.3% for Target 14, and 94.1% for Target 18. The origin of successes and failures is discussed. .

Algorithms↗