Docking by structural similarity at protein‐protein interfaces
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Rapid accumulation of experimental data on protein‐protein complexes drives the paradigm shift in protein docking from “traditional,” template free approaches to template based techniques. Homology docking algorithms based on sequence similarity between target and template complexes can account for up to 20% of known protein‐protein interactions. When highly homologous templates for the target complex are not available, but the structure of the target monomers is known, docking by local structural alignment may provide an adequate solution. Such an algorithm was developed based on the structural comparison of monomers to cocrystallized interfaces. A library of the interfaces was generated from cocrystallized protein‐protein complexes in PDB. The partial structure alignment algorithm was validated on the D OCKGROUND benchmark sets. The optimal performance of the partial (interface) structure alignment was achieved with the interface residues defined by 12 Å distance across the interface. Overall, the partial structure alignment yielded more accurate models than the full structure alignment. Most templates identified by the partial structure alignment had low sequence identity to the target, which makes them hard to detect by sequence‐based methods. The results indicate that the structure alignment techniques provide a much needed addition to the docking arsenal, with the combined structure alignment and template free docking success rate significantly surpassing that of the free docking alone. Proteins 2010. © 2010 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
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
Prism: Protein-Protein Interaction Prediction by Structural Matching
Keskin, O., Nussinov, R., & Gursoy, A. (2008) · Methods in Molecular Biology · doi:10.1007/978-1-59745-398-1_30 · Cited by 80
Cited by
On the binding affinity of macromolecular interactions: daring to ask why proteins interact
Kastritis, P. L., & Bonvin, A. M. J. J. (2013) · Journal of The Royal Society Interface · doi:10.1098/rsif.2012.0835 · Cited by 520
Vreven, T., Moal, I. H., Vangone, A., Pierce, B. G., Kastritis, P. L., Torchala, M., Chaleil, R., Jiménez-García, B., Bates, P. A., Fernandez-Recio, J., et al. (2015) · Journal of Molecular Biology · doi:10.1016/j.jmb.2015.07.016 · Cited by 424
Protein-Protein Docking: From Interaction to Interactome
Vakser, I. A. (2014) · Biophysical Journal · doi:10.1016/j.bpj.2014.08.033 · Cited by 318
Self-citationFundamentals of protein interaction network mapping
Snider, J., Kotlyar, M., Saraon, P., Yao, Z., Jurisica, I., & Stagljar, I. (2015) · Molecular Systems Biology · doi:10.15252/msb.20156351 · Cited by 298
Tuncbag, N., Gursoy, A., Nussinov, R., & Keskin, O. (2011) · Nature Protocols · doi:10.1038/nprot.2011.367 · Cited by 263
Templates 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
Mapping Monomeric Threading to Protein–Protein Structure Prediction
Guerler, A., Govindarajoo, B., & Zhang, Y. (2013) · Journal of Chemical Information and Modeling · doi:10.1021/ci300579r · Cited by 73
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
“The latter, while potentially providing much greater success rate [53], critically depends on the availability of the templates [36••, 37•• ,55••, 56•].”
Exploiting Conformational Ensembles in Modeling Protein–Protein Interactions on the Proteome Scale
Kuzu, G., Gursoy, A., Nussinov, R., & Keskin, O. (2013) · Journal of Proteome Research · doi:10.1021/pr400006k · Cited by 47
New benchmark metrics for protein‐protein docking methods
Gao, M., & Skolnick, J. (2011) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.22987 · Cited by 42
Assessing 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
“Accordingly, many computational methods have been developed to fill this gap, aiming at covering different regions of the interaction space (Korkin et al., 2006; Kundrotas et al., 2010; Sinha et al., 2010; Szilagyi and Zhang, 2014).”
InfluentialDistance‐based reconstruction of protein quaternary structures from inter‐chain contacts
Soltanikazemi, E., Quadir, F., Roy, R. S., Guo, Z., & Cheng, J. (2022) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.26269 · Cited by 15
Chakravarty, D., McElfresh, G., Kundrotas, P. J., & Vakser, I. A. (2020) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.25875 · Cited by 13
Self-citation
Metadata
- Authors
- Sinha, R., Kundrotas, P. J., & Vakser, I. A.
- Venue
- Proteins: Structure, Function, and Bioinformatics
- Publisher
- Wiley
- Published
- 2010-06-29
- Volume
- 78
- Issue
- 15
- Pages
- 3235-3241
- ISSN
- 0887-3585 (ISSN-L)
- 1097-0134
- OpenAlex
- W1970008650
- Cited by
- 85
- References
- 2
- FWCI
- 3.31
- 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.