The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Protein Design is NP-hard
Open accessAbstract
Biologists working in the area of computational protein design have never doubted the seriousness of the algorithmic challenges that face them in attempting in silico sequence selection. It turns out that in the language of the computer science community, this discrete optimization problem is NP-hard. The purpose of this paper is to explain the context of this observation, to provide a simple illustrative proof and to discuss the implications for future progress on algorithms for computational protein design.
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
(1979) · Cited by 43,841
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
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
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Probabilistic Reasoning in Intelligent Systems
(1988) · Elsevier eBooks · doi:10.1016/c2009-0-27609-4 · Cited by 3,321
P-Complete Approximation Problems
Sahni, S., & Gonzalez, T. (1976) · Journal of the ACM · doi:10.1145/321958.321975 · Cited by 1,703
The Traveling Salesman Problem
(2019) · Fundamentals of Supply Chain Theory · doi:10.1002/9781119584445.ch10 · Cited by 1,614
Tertiary templates for proteins
Ponder, J. W., & Richards, F. M. (1987) · Journal of Molecular Biology · doi:10.1016/0022-2836(87)90358-5 · Cited by 1,478
De Novo Protein Design: Fully Automated Sequence Selection
Dahiyat, B. I., & Mayo, S. L. (1997) · Science · doi:10.1126/science.278.5335.82 · Cited by 1,145
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Arora, S. (1998) · Journal of the ACM · doi:10.1145/290179.290180 · Cited by 1,137
Cited by
MolProbity: all-atom contacts and structure validation for proteins and nucleic acids
Davis, I. W., Leaver-Fay, A., Chen, V. B., Block, J. N., Kapral, G. J., Wang, X., Murray, L. W., Arendall, W. B., Snoeyink, J., Richardson, J. S., et al. (2007) · Nucleic Acids Research · doi:10.1093/nar/gkm216 · Cited by 3,896
Leaver-Fay (2011) · doi:10.1016/b978-0-12-381270-4.00019-6 · Cited by 1,904
Machine-learning-guided directed evolution for protein engineering
Yang, K. K., Wu, Z., & Arnold, F. H. (2019) · Nature Methods · doi:10.1038/s41592-019-0496-6 · Cited by 1,130
Coarse-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
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
Metadata
- Authors
- Pierce, N. A., & Winfree, E.
- Venue
- Protein Engineering, Design and Selection
- Publisher
- Oxford University Press (OUP)
- Published
- 2002-10
- Volume
- 15
- Issue
- 10
- Pages
- 779-782
- ISSN
- 0269-2139 (ISSN-L)
- 1741-0134
- 1741-0126
- OpenAlex
- W2106775540
- Cited by
- 267
- References
- 33
- FWCI
- 2.48
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Protein Design is NP-hard. https://app.cochat.ai/papers/10.1093/protein/15.10.779
- The paper
- Pierce, N. A., & Winfree, E. (2002). Protein Design is NP-hard. Protein Engineering, Design and Selection. https://doi.org/10.1093/protein/15.10.779
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.