The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Optimal docking area: A new method for predicting protein–protein interaction sites
Abstract
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. Proteins 2005. © 2004 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 protein-protein interactions
Jones, S., & Thornton, J. M. (1996) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.93.1.13 · Cited by 2,684
Anatomy of hot spots in protein interfaces
Bogan, A. A., & Thorn, K. S. (1998) · Journal of Molecular Biology · doi:10.1006/jmbi.1998.1843 · Cited by 1,988
Cited by
Characterization of Molecular Recognition Features, MoRFs, and Their Binding Partners
Vacic, V., Oldfield, C. J., Mohan, A., Radivojac, P., Cortese, M. S., Uversky, V. N., & Dunker, A. K. (2007) · Journal of Proteome Research · doi:10.1021/pr0701411 · Cited by 483
Structural basis for protein–protein interactions in the 14-3-3 protein family
Yang, X., Lee, W. H., Sobott, F., Papagrigoriou, E., Robinson, C. V., Grossmann, J. G., Sundström, M., Doyle, D. A., & Elkins, J. M. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0605779103 · Cited by 413
Recent Progress and Future Directions in Protein-Protein Docking
Ritchie, D. (2008) · Current Protein & Peptide Science · doi:10.2174/138920308783565741 · Cited by 316
Murakami, Y., & Mizuguchi, K. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq302 · Cited by 303
Nayal, M., & Honig, B. (2006) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.20897 · Cited by 284
ISIS: interaction sites identified from sequence
Ofran, Y., & Rost, B. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btl303 · Cited by 258
Protein–Protein Interaction Hotspots Carved into Sequences
Ofran, Y., & Rost, B. (2007) · PLoS Computational Biology · doi:10.1371/journal.pcbi.0030119 · Cited by 255
Ferritin is secreted via 2 distinct nonclassical vesicular pathways
Truman-Rosentsvit, M., Berenbaum, D., Spektor, L., Cohen, L. A., Belizowsky-Moshe, S., Lifshitz, L., Ma, J., Li, W., Kesselman, E., Abutbul-Ionita, I., et al. (2018) · Blood · doi:10.1182/blood-2017-02-768580 · Cited by 223
A transgenic approach for controlling Lygus in cotton
Gowda, A., Rydel, T. J., Wollacott, A. M., Brown, R. S., Akbar, W., Clark, T. L., Flasinski, S., Nageotte, J. R., Read, A. C., Shi, X., et al. (2016) · Nature Communications · doi:10.1038/ncomms12213 · Cited by 91
Casal, E., Federici, L., Zhang, W., Fernandez-Recio, J., Priego, E.-M., Miguel, R. N., DuHadaway, J. B., Prendergast, G. C., Luisi, B. F., & Laue, E. D. (2006) · Biochemistry · doi:10.1021/bi060717k · Cited by 77
Self-citation
Metadata
- Authors
- Fernandez‐Recio, J., Totrov, M., Skorodumov, C., & Abagyan, R.
- Venue
- Proteins: Structure, Function, and Bioinformatics
- Publisher
- Wiley
- Published
- 2004-10-19
- Volume
- 58
- Issue
- 1
- Pages
- 134-143
- ISSN
- 0887-3585 (ISSN-L)
- 1097-0134
- OpenAlex
- W1971722050
- Cited by
- 204
- References
- 2
- FWCI
- 5.58
- 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.