On the complexity of protein folding.
We show that the protein folding problem in the two-dimensional H-P model is NP-complete.
Dipartimento di Sistemi e Informatica, Università di Firenze, Italy.
P
P
Crescenzi
D
D
Goldman
C
C
Papadimitriou
A
A
Piccolboni
M
M
Yannakakis
D008956:Models, Chemical; D017510:Protein Folding