On the complexity of protein folding
J Comput Biol
.
1998 Fall;5(3):423-65.
doi: 10.1089/cmb.1998.5.423.
Authors
P Crescenzi
1
,
D Goldman
,
C Papadimitriou
,
A Piccolboni
,
M Yannakakis
Affiliation
1
Dipartimento di Sistemi e Informatica, Università di Firenze, Italy.
PMID:
9773342
DOI:
10.1089/cmb.1998.5.423
Abstract
We show that the protein folding problem in the two-dimensional H-P model is NP-complete.
MeSH terms
Models, Chemical*
Protein Folding*