Progress in protein–protein docking: Atomic resolution predictions in the CAPRI experiment using RosettaDock with an improved treatment of side‐chain flexibility
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
RosettaDock uses real‐space Monte Carlo minimization (MCM) on both rigid‐body and side‐chain degrees of freedom to identify the lowest free energy docked arrangement of 2 protein structures. An improved version of the method that uses gradient‐based minimization for off‐rotamer side‐chain optimization and includes information from unbound structures was used to create predictions for Rounds 4 and 5 of CAPRI. First, large numbers of independent MCM trajectories were carried out and the lowest free energy docked configurations identified. Second, new trajectories were started from these lowest energy structures to thoroughly sample the surrounding conformation space, and the lowest energy configurations were submitted as predictions. For all cases in which there were no significant backbone conformational changes, a small number of very low‐energy configurations were identified in the first, global search and subsequently found to be close to the center of the basin of attraction in the free energy landscape in the second, local search. Following the release of the experimental coordinates, it was found that the centers of these free energy minima were remarkably close to the native structures in not only the rigid‐body orientation but also the detailed conformations of the side‐chains. Out of 8 targets, the lowest energy models had interface root‐mean‐square deviations (RMSDs) less than 1.1 Å from the correct structures for 6 targets, and interface RMSDs less than 0.4 Å for 3 targets. The predictions were top submissions to CAPRI for Targets 11, 12, 14, 15, and 19. The close correspondence of the lowest free energy structures found in our searches to the experimental structures suggests that our free energy function is a reasonable representation of the physical chemistry, and that the real space search with full side‐chain flexibility to some extent solves the protein–protein docking problem in the absence of significant backbone conformational changes. On the other hand, the approach fails when there are significant backbone conformational changes as the steric complementarity of the 2 proteins cannot be modeled without incorporating backbone flexibility, and this is the major goal of our current work. Proteins 2005;60:187–194. © 2005 Wiley‐Liss, Inc.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Principles of docking: An overview of search algorithms and a guide to scoring functions
Halperin, I., Ma, B., Wolfson, H., & Nussinov, R. (2002) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.10115 · Cited by 1,294 · cited 2×
“Various docking approaches have been developed over the years (see Halperin et al.(2) and Vajda and Camacho(3) for reviews).”
CAPRI: A Critical Assessment of PRedicted Interactions
Janin, J., Henrick, K., Moult, J., Eyck, L. T., Sternberg, M. J. E., Vajda, S., Vakser, I., & Wodak, S. J. (2003) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.10381 · Cited by 703
Cited by
Optimal description of a protein structure in terms of multiple groups undergoing TLS motion
Painter, J., & Merritt, E. A. (2006) · Acta Crystallographica Section D Biological Crystallography · doi:10.1107/s0907444906005270 · Cited by 1,240
Macromolecular Modeling with Rosetta
Das, R., & Baker, D. (2008) · Annual Review of Biochemistry · doi:10.1146/annurev.biochem.77.062906.171838 · Cited by 989
Self-citationThe RosettaDock server for local protein-protein docking
Lyskov, S., & Gray, J. J. (2008) · Nucleic Acids Research · doi:10.1093/nar/gkn216 · Cited by 592
ROSETTALIGAND: Protein–small molecule docking with full side‐chain flexibility
Meiler, J., & Baker, D. (2006) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.21086 · Cited by 505
Self-citationRaveh, B., London, N., & Schueler-Furman, O. (2010) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.22716 · Cited by 430
Self-citationProtein–Protein Docking with Backbone Flexibility
Wang, C., Bradley, P., & Baker, D. (2007) · Journal of Molecular Biology · doi:10.1016/j.jmb.2007.07.050 · Cited by 414
Self-citationPractically Useful: What the R osetta Protein Modeling Suite Can Do for You
Kaufmann, K. W., Lemmon, G. H., DeLuca, S. L., Sheehan, J. H., & Meiler, J. (2010) · Biochemistry · doi:10.1021/bi902153g · Cited by 402
Recent Progress and Future Directions in Protein-Protein Docking
Ritchie, D. (2008) · Current Protein & Peptide Science · doi:10.2174/138920308783565741 · Cited by 316
Flexible protein–protein docking
Bonvin, A. M. (2006) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2006.02.002 · Cited by 309
Progress in Modeling of Protein Structures and Interactions.
Schueler-Furman, O., Wang, C., Bradley, P., Misura, K., & Baker, D. (2005) · Science · doi:10.1126/science.1112160 · Cited by 294
Self-citationCoarse-grained Models for Simulations of Multiprotein Complexes: Application to Ubiquitin Binding
Kim, Y. C., & Hummer, G. (2008) · Journal of Molecular Biology · doi:10.1016/j.jmb.2007.11.063 · Cited by 288
RosettaAntibodyDesign (RAbD): a general framework for computational antibody design
Adolf-Bryfogle, J., Kalyuzhniy, O., Kubitz, M., Weitzner, B. D., Hu, X., Adachi, Y., Schief, W. R., & Dunbrack, R. L. (2018) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1006112 · Cited by 227
“This is an optional alternative for the minimization step One further option is in the inner loop is integrated sampling of the antibody-antigen orientation during design uses the underlying framework and docking algorithms of Rosetta-Dock [45,103–106].”
MethodDeep Learning of High-Order Interactions for Protein Interface Prediction
Liu, Y., Yuan, H., Cai, L., & Ji, S. (2020) · Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3394486.3403110 · Cited by 48
“Docking meth-ods [27, 32] typically predict several possible protein complexes from the given proteins, then use ranking criteria to decide the most native one.”
BackgroundLimits and potential of combined folding and docking
Pozzati, G., Zhu, W., Bassot, C., Lamb, J., Kundrotas, P., & Elofsson, A. (2022) · Bioinformatics · doi:10.1093/bioinformatics/btab760 · Cited by 25
Metadata
- Authors
- Schueler‐Furman, O., Wang, C., & Baker, D.
- Venue
- Proteins: Structure, Function, and Bioinformatics
- Publisher
- Wiley
- Published
- 2005-06-24
- Volume
- 60
- Issue
- 2
- Pages
- 187-194
- ISSN
- 0887-3585 (ISSN-L)
- 1097-0134
- OpenAlex
- W2066244933
- Cited by
- 99
- References
- 2
- FWCI
- 4.72
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.