Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete.
One of the simplest and most popular biophysical models of protein folding is the hydrophobic-hydrophilic (HP) model. The HP model abstracts the hydrophobic interaction in protein folding by labeling the amino acids as hydrophobic (H for nonpolar) or hydrophilic (P for polar). Chains of amino acids are configured as self-avoiding walks on the 3D cubic lattice, where an optimal conformation maximizes the number of adjacencies between H's. In this paper, the protein folding problem under the HP model on the cubic lattice is shown to be NP-complete. This means that the protein folding problem belongs to a large set of problems that are believed to be computationally intractable.
Berger
B
B
Mathematics Department and Laboratory for Computer Science, MIT, Cambridge, MA 02139, USA.
Leighton
T
T
D000465:Algorithms; D000595:Amino Acid Sequence; D000596:Amino Acids / Q000737:chemistry; D008956:Models, Chemical; D008969:Molecular Sequence Data; D017510:Protein Folding; D011506:Proteins / Q000737:chemistry
D000596:Amino Acids; D011506:Proteins