Fast and simple monte carlo algorithm for side chain optimization in proteins: Application to model building by homology
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
An unknown protein structure can be predicted with fair accuracy once an evolutionary connection at the sequence level has been made to a protein of known 3‐D structure. In model building by homology, one typically starts with a backbone framework, rebuilds new loop regions, and replaces nonconserved side chains. Here, we use an extremely efficient Monte Carlo algorithm in rotamer space with simulated annealing and simple potential energy functions to optimize the packing of side chains on given backbone models. Optimized models are generated within minutes on a workstation, with reasonable accuracy (average of 81% side chain χ 1 dihedral angles correct in the cores of proteins determined at better than 2.5 Å resolution). As expected, the quality of the models decreases with decreasing accuracy of backbone coordinates. If the backbone was taken from a homologous rather than the same protein, about 70% side chain X 1 angles were modeled correctly in the core in a case of strong homology and about 60% in a case of medium homology. The algorithm can be used in automated, fast, and reproducible model building by homology. © 1992 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
The relation between the divergence of sequence and structure in proteins.
Chothia, C., & Lesk, A. M. (1986) · The EMBO Journal · doi:10.1002/j.1460-2075.1986.tb04288.x · Cited by 2,458
Cited by
Combining evolutionary information and neural networks to predict protein secondary structure
Rost, B., & Sander, C. (1994) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.340190108 · Cited by 1,452
Self-citationCoarse-Grained Protein Models and Their Applications
Kmiecik, S., Gront, D., Kolinski, M., Wieteska, L., Dawid, A. E., & Kolinski, A. (2016) · Chemical Reviews · doi:10.1021/acs.chemrev.6b00163 · Cited by 1,071
Zhou, H., & Zhou, Y. (2002) · Protein Science · doi:10.1110/ps.0217002 · Cited by 902
FireDock: Fast interaction refinement in molecular docking
Andrusier, N., Nussinov, R., & Wolfson, H. J. (2007) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.21495 · Cited by 679
Bower, M. J., Cohen, F. E., & Dunbrack, R. L. (1997) · Journal of Molecular Biology · doi:10.1006/jmbi.1997.0926 · Cited by 551
Metadata
- Authors
- Holm, L., & Sander, C.
- Venue
- Proteins: Structure, Function, and Bioinformatics
- Publisher
- Wiley
- Published
- 1992-10
- Volume
- 14
- Issue
- 2
- Pages
- 213-223
- ISSN
- 0887-3585 (ISSN-L)
- 1097-0134
- OpenAlex
- W2091477689
- Cited by
- 152
- References
- 1
- FWCI
- 3.82
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fast and simple monte carlo algorithm for side chain optimization in proteins: Application to model building by homology. https://app.cochat.ai/papers/10.1002/prot.340140208
- The paper
- Holm, L., & Sander, C. (1992). Fast and simple monte carlo algorithm for side chain optimization in proteins: Application to model building by homology. Proteins: Structure, Function, and Bioinformatics. https://doi.org/10.1002/prot.340140208
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.