Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 290

The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.

A test of lattice protein folding algorithms.

Open access
Yue, K, Fiebig, K M, Thomas, P D, Chan, H S, Shakhnovich, E I, Dill, K A·1995·Proceedings of the National Academy of Sciences

Abstract

We report a blind test of lattice-model-based search strategies for finding global minima of model protein chains. One of us (E.I.S.) selected 10 compact conformations of 48-mer chains on the three-dimensional cubic lattice and used their inverse folding algorithm to design HP (H, hydrophobic; P, polar) sequences that should fold to those "target" structures. The sequences, but not the structures, were sent to the UCSF group (K.Y., K.M.F., P.D.T., H.S.C., and K.A.D.), who used two methods to attempt to find the globally optimal conformations: "hydrophobic zippers" and a constraint-based hydrophobic core construction (CHCC) method. The CHCC method found global minima in all cases, and the hydrophobic zippers method found global minima in some cases, in minutes to hours on workstations. In 9 out of 10 sequences, the CHCC method found lower energy conformations than the 48-mers were designed to fold to. Thus the search strategies succeed for the HP model but the design strategy does not. For every sequence the global energy minimum was found to have multiple degeneracy with 10(3) to 10(6) conformations. We discuss the implications of these results for (i) searching conformational spaces of simple models of proteins and (ii) how these simple models relate to proteins.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1073/pnas.92.1.325

Cites

18 of 18 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 18 references

Cited by

See all 290

Metadata

Authors
Yue, K., Fiebig, K. M., Thomas, P. D., Chan, H. S., Shakhnovich, E. I., & Dill, K. A.
Venue
Proceedings of the National Academy of Sciences
Published
1995-01-03
Volume
92
Issue
1
Pages
325-329
ISSN
  • 0027-8424 (ISSN-L)
  • 1091-6490
OpenAlex
W2139415631
Cited by
290
References
18
FWCI
5.45
Type
journal article
Language
en
Open access
green

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: A test of lattice protein folding algorithms. https://app.cochat.ai/papers/10.1073/pnas.92.1.325
The paper
Yue, K., Fiebig, K. M., Thomas, P. D., Chan, H. S., Shakhnovich, E. I., & Dill, K. A. (1995). A test of lattice protein folding algorithms. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.92.1.325

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.