The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Development and testing of an automated approach to protein docking
Abstract
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 Å and 1.88 Å 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. Proteins 2005;60:296–301. © 2005 Wiley‐Liss, Inc.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
Self-citation
Cited by
GRAMM-X public web server for protein-protein docking
Tovchigrechko, A., & Vakser, I. A. (2006) · Nucleic Acids Research · doi:10.1093/nar/gkl206 · Cited by 807
Self-citationPerformance and Its Limits in Rigid Body Protein-Protein Docking
Desta, I. T., Porter, K. A., Xia, B., Kozakov, D., & Vajda, S. (2020) · Structure · doi:10.1016/j.str.2020.06.006 · Cited by 703
Protein Structure and Function Prediction Using I‐TASSER
Yang, J., & Zhang, Y. (2015) · Current Protocols in Bioinformatics · doi:10.1002/0471250953.bi0508s52 · Cited by 559
Recent Progress and Future Directions in Protein-Protein Docking
Ritchie, D. (2008) · Current Protein & Peptide Science · doi:10.2174/138920308783565741 · Cited by 316
Coarse-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
Metadata
- Authors
- Tovchigrechko, A., & Vakser, I. A.
- Venue
- Proteins: Structure, Function, and Bioinformatics
- Publisher
- Wiley
- Published
- 2005-06-24
- Volume
- 60
- Issue
- 2
- Pages
- 296-301
- ISSN
- 0887-3585 (ISSN-L)
- 1097-0134
- OpenAlex
- W2016333765
- Cited by
- 178
- References
- 2
- FWCI
- 2.77
- 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.