Modeling complexes of modeled proteins
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
Structural characterization of proteins is essential for understanding life processes at the molecular level. However, only a fraction of known proteins have experimentally determined structures. This fraction is even smaller for protein–protein complexes. Thus, structural modeling of protein–protein interactions (docking) primarily has to rely on modeled structures of the individual proteins, which typically are less accurate than the experimentally determined ones. Such “double” modeling is the Grand Challenge of structural reconstruction of the interactome. Yet it remains so far largely untested in a systematic way. We present a comprehensive validation of template‐based and free docking on a set of 165 complexes, where each protein model has six levels of structural accuracy, from 1 to 6 Å C α RMSD. Many template‐based docking predictions fall into acceptable quality category, according to the CAPRI criteria, even for highly inaccurate proteins (5–6 Å RMSD), although the number of such models (and, consequently, the docking success rate) drops significantly for models with RMSD > 4 Å. The results show that the existing docking methodologies can be successfully applied to protein models with a broad range of structural accuracy, and the template‐based docking is much less sensitive to inaccuracies of protein models than the free docking. Proteins 2017; 85:470–478. © 2016 Wiley Periodicals, 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
TM-align: a protein structure alignment algorithm based on the TM-score
Zhang, Y. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki524 · Cited by 3,774
Ovchinnikov, S., Kamisetty, H., & Baker, D. (2014) · eLife · doi:10.7554/elife.02030 · Cited by 629
Sequence co-evolution gives 3D contacts and structures of protein complexes
Hopf, T. A., Schärfe, C. P. I., Rodrigues, J. P. G. L. M., Green, A. G., Kohlbacher, O., Sander, C., Bonvin, A. M. J. J., & Marks, D. S. (2014) · eLife · doi:10.7554/elife.03430 · Cited by 515
Protein-Protein Docking: From Interaction to Interactome
Vakser, I. A. (2014) · Biophysical Journal · doi:10.1016/j.bpj.2014.08.033 · Cited by 318 · cited 2×
“FSC-score5 jStempl\Smodelj jStempl[Smodelj ; (3)”
BackgroundSelf-citationDocking, scoring, and affinity prediction in CAPRI
Lensink, M. F., & Wodak, S. J. (2013) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.24428 · Cited by 249
A systematic study of low-resolution recognition in protein-protein complexes
Vakser, I. A., Matar, O. G., & Lam, C. F. (1999) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.96.15.8477 · Cited by 180 · cited 2×
“The study also was restricted to the ultra-low resolution free docking,9 effectively predicting the binding sites only.”
BackgroundSelf-citationTemplates are available to model nearly all complexes of structurally characterized proteins
Kundrotas, P. J., Zhu, Z., Janin, J., & Vakser, I. A. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1200678109 · Cited by 179
Low-resolution structural modeling of protein interactome
Vakser, I. A. (2013) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2012.12.003 · Cited by 62 · cited 2×
“(2)] can be considered a modification of fnat, such that the number of shared contacts is normalized by the number of contacts in either of the two models, making the score symmetric (FSCij 5 FSCji).”
BackgroundMethodAssessing the Applicability of Template-Based Protein Docking in the Twilight Zone
Negroni, J., Mosca, R., & Aloy, P. (2014) · Structure · doi:10.1016/j.str.2014.07.009 · Cited by 35 · cited 1×
“However for some complexes (for example, those with the alternative binding modes or in the twilight zone of target/template similarity) such scoring may not lead to the correct solution (similar conclusions were reached by Negroni et al .38).”
Result
Cited by
Critical assessment of methods of protein structure prediction (CASP)—Round XIII
Kryshtafovych, A., Schwede, T., Topf, M., Fidelis, K., & Moult, J. (2019) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.25823 · Cited by 506
Assessment of the CASP14 assembly predictions
Ozden, B., Kryshtafovych, A., & Karaca, E. (2021) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.26199 · Cited by 41
“Strikingly, their best H1065 model emanated from using the CASP server models as an input to TMdock, 49,50 (Elofsson Group, personal communication).”
MethodImproved Antibody‐Specific Epitope Prediction Using AlphaFold and AbAdapt**
(2022) · doi:10.1002/cbic.202200303 · Cited by 36
Contact Potential for Structure Prediction of Proteins and Protein Complexes from Potts Model
Anishchenko, I., Kundrotas, P. J., & Vakser, I. A. (2018) · Biophysical Journal · doi:10.1016/j.bpj.2018.07.035 · Cited by 29
“In addition, a simple resi-due-residue contact potential by Miyazawa and Jernigan MJ3h (80) was also tested because of its best performance in scoring of protein docking decoys (81,82).”
BackgroundSelf-citationLimits 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
Self-citation
Metadata
- Authors
- Anishchenko, I., Kundrotas, P. J., & Vakser, I. A.
- Venue
- Proteins: Structure, Function, and Bioinformatics
- Publisher
- Wiley
- Published
- 2016-10-24
- Volume
- 85
- Issue
- 3
- Pages
- 470-478
- ISSN
- 0887-3585 (ISSN-L)
- 1097-0134
- OpenAlex
- W2527710896
- Cited by
- 27
- References
- 9
- FWCI
- 1.96
- Type
- journal article
- Language
- en
- Open access
- green
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.