Local energy landscape flattening: Parallel hyperbolic Monte Carlo sampling of protein folding
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Among the major difficulties in protein structure prediction is the roughness of the energy landscape that must be searched for the global energy minimum. To address this issue, we have developed a novel Monte Carlo algorithm called parallel hyperbolic sampling (PHS) that logarithmically flattens local high‐energy barriers and, therefore, allows the simulation to tunnel more efficiently through energetically inaccessible regions to low‐energy valleys. Here, we show the utility of this approach by applying it to the SICHO (SIde‐CHain‐Only) protein model. For the same CPU time, the parallel hyperbolic sampling method can identify much lower energy states and explore a larger region phase space than the commonly used replica sampling (RS) Monte Carlo method. By clustering the simulated structures obtained in the PHS implementation of the SICHO model, we can successfully predict, among a representative benchmark 65 proteins set, 50 cases in which one of the top 5 clusters have a root‐mean‐square deviation (RMSD) from the native structure below 6.5 Å. Compared with our previous calculations that used RS as the conformational search procedure, the number of successful predictions increased by four and the CPU cost is reduced. By comparing the structure clusters produced by both PHS and RS, we find a strong correlation between the quality of predicted structures and the minimum relative RMSD (mrRMSD) of structures clusters identified by using different search engines. This mrRMSD correlation may be useful in blind prediction as an indicator of the likelihood of successful folds. Proteins 2002;48:192–201. © 2002 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 that Govern the Folding of Protein Chains
Anfinsen, C. B. (1973) · Science · doi:10.1126/science.181.4096.223 · Cited by 7,096 · cited 1×
“structure; this corresponds to the native state according to the thermodynamic hypothesis of Anfinsen.(1) In principle,”
Cited by
I-TASSER: a unified platform for automated protein structure and function prediction
Roy, A., Kucukural, A., & Zhang, Y. (2010) · Nature Protocols · doi:10.1038/nprot.2010.5 · Cited by 6,170
Self-citationI-TASSER server for protein 3D structure prediction
Zhang, Y. (2008) · BMC Bioinformatics · doi:10.1186/1471-2105-9-40 · Cited by 5,124
Self-citationLOMETS: A local meta-threading-server for protein structure prediction
Wu, S., & Zhang, Y. (2007) · Nucleic Acids Research · doi:10.1093/nar/gkm251 · Cited by 778
Self-citationAb initio modeling of small proteins by iterative TASSER simulations
Wu, S., Skolnick, J., & Zhang, Y. (2007) · BMC Biology · doi:10.1186/1741-7007-5-17 · Cited by 514
Self-citationTemplate-based modeling and free modeling by I-TASSER in CASP7
Zhang, Y. (2007) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.21702 · Cited by 466
Self-citationSPICKER: A clustering approach to identify near‐native protein folds
Zhang, Y., & Skolnick, J. (2004) · Journal of Computational Chemistry · doi:10.1002/jcc.20011 · Cited by 393
Self-citationAutomated structure prediction of weakly homologous proteins on a genomic scale
Zhang, Y., & Skolnick, J. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0305695101 · Cited by 344
Self-citationThe protein structure prediction problem could be solved using the current PDB library
Zhang, Y., & Skolnick, J. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0407152101 · Cited by 297
Self-citationProtein structure prediction: when is it useful?
Zhang, Y. (2009) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2009.02.005 · Cited by 277
“The authors used a modified replica-exchange Monte Carlo simulation method [46] to search the conformational space, where the improvement of the energy funnel shape is of the key importance for guiding the simulations toward to the native state.”
MethodSelf-citationTOUCHSTONE II: A New Approach to Ab Initio Protein Structure Prediction
Zhang, Y., Kolinski, A., & Skolnick, J. (2003) · Biophysical Journal · doi:10.1016/s0006-3495(03)74551-2 · Cited by 272
Self-citationDeep‐learning contact‐map guided protein structure prediction in CASP13
Zheng, W., Li, Y., Zhang, C., Pearce, R., Mortuza, S. M., & Zhang, Y. (2019) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.25792 · Cited by 208
Self-citationM-TASSER: An Algorithm for Protein Quaternary Structure Prediction
Chen, H., & Skolnick, J. (2008) · Biophysical Journal · doi:10.1529/biophysj.107.114280 · Cited by 68
Self-citation
Metadata
- Authors
- Zhang, Y., Kihara, D., & Skolnick, J.
- Venue
- Proteins: Structure, Function, and Bioinformatics
- Publisher
- Wiley
- Published
- 2002-05-29
- Volume
- 48
- Issue
- 2
- Pages
- 192-201
- ISSN
- 0887-3585 (ISSN-L)
- 1097-0134
- OpenAlex
- W2116901406
- Cited by
- 138
- References
- 1
- FWCI
- 2.48
- 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.