The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications
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 that Govern the Folding of Protein Chains
Anfinsen, C. B. (1973) · Science · doi:10.1126/science.181.4096.223 · Cited by 7,096
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Cited by
Funnels, pathways, and the energy landscape of protein folding: A synthesis
Bryngelson, J. D., Onuchic, J. N., Socci, N. D., & Wolynes, P. G. (1995) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.340210302 · Cited by 2,648
“case requires exponentially more computational time as the size of the problem grows. Finding the lowest free energy state of a macromolecule with a general sequence also been shown to be NP-complete [33]. NP-completeness is a worst case analysis; if a problem is proven to be NP-complete then finding the solution to at…”
BackgroundAnt colony optimization: Introduction and recent trends
Blum, C. (2005) · Physics of Life Reviews · doi:10.1016/j.plrev.2005.10.001 · Cited by 1,308
Dill, K. A., Ozkan, S. B., Shell, M. S., & Weikl, T. R. (2008) · Annual Review of Biophysics · doi:10.1146/annurev.biophys.37.092707.153558 · Cited by 1,163
Genetic Algorithms for Protein Folding Simulations
Unger, R., & Moult, J. (1993) · Journal of Molecular Biology · doi:10.1006/jmbi.1993.1258 · Cited by 521
Self-citationProtein Folding in the Hydrophobic-Hydrophilic ( HP ) Model is NP-Complete
BERGER, B., & LEIGHTON, T. (1998) · Journal of Computational Biology · doi:10.1089/cmb.1998.5.27 · Cited by 420
Kinetics of protein folding: Nucleation mechanism, time scales, and pathways
Guo, Z., & Thirumalai, D. (1995) · Biopolymers · doi:10.1002/bip.360360108 · Cited by 339
The Levinthal paradox: yesterday and today
Karplus, M. (1997) · Folding and Design · doi:10.1016/s1359-0278(97)00067-9 · Cited by 264
Metadata
- Authors
- Unger, R., & Moult, J.
- Venue
- Bulletin of Mathematical Biology
- Published
- 1993-11
- Volume
- 55
- Issue
- 6
- Pages
- 1183-1198
- ISSN
- 0092-8240 (ISSN-L)
- 1522-9602
- OpenAlex
- W1976493332
- Cited by
- 196
- References
- 2
- FWCI
- 2.37
- 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.
