Protein folding in the hydrophobic-hydrophilic (HP) 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.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  K. Dill.  Theory for the folding and stability of globular proteins. , 1985, Biochemistry.

[3]  Arnold L. Rosenberg,et al.  Three-Dimensional Circuit Layouts , 1984, SIAM J. Comput..

[4]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[5]  J T Ngo,et al.  Computational complexity of a problem in molecular structure prediction. , 1992, Protein engineering.

[6]  Ron Unger,et al.  Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications , 1993 .

[7]  Joe Marks,et al.  Computational Complexity, Protein Structure Prediction, and the Levinthal Paradox , 1994 .

[8]  R. Lathrop.  The protein threading problem with sequence amino acid interaction preferences is NP-complete. , 1994, Protein engineering.

[9]  J. Onuchic,et al.  Funnels, pathways, and the energy landscape of protein folding: A synthesis , 1994, Proteins.

[10]  William E. Hart,et al.  Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal , 1995, STOC '95.

[11]  D. Yee,et al.  Principles of protein folding — A perspective from simple exact models , 1995, Protein science : a publication of the Protein Society.

[12]  Mike Paterson,et al.  On the Complexity of String Folding , 1996, Discret. Appl. Math..

[13]  William E. Hart,et al.  Fast Protein Folding in the Hydrophobic-Hydrophillic Model within Three-Eights of Optimal , 1996, J. Comput. Biol..

[14]  Aviezri S. Fraenkel.  Protein folding, spin glass and computational complexity , 1997, DNA Based Computers.

[15]  William E. Hart.  On the computational complexity of sequence design problems , 1997, RECOMB '97.

[16]  William E. Hart,et al.  Robust Proofs of NP-Hardness for Protein Folding: General Lattices and Energy Potentials , 1997, J. Comput. Biol..

[17]  William E. Hart,et al.  Lattice and Off-Lattice Side Chain Models of Protein Folding: Linear Time Structure Prediction Better than 86% of Optimal , 1997, J. Comput. Biol..

[18]  Steven Skiena,et al.  Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model , 1997, J. Comput. Biol..

[19]  William E. Hart,et al.  Lattice and off-lattice side chain models of protein folding (extended abstract): linear time structure prediction better than 86% of optimal , 1997, RECOMB '97.

[20]  B. Berger,et al.  Protein Folding in the Hydrophobic-Hydrophilic(HP) Model is NP-Complete , 1998, J. Comput. Biol..

[21]  Uri Zwick,et al.  Spatial codes and the hardness of string folding problems , 1998, SODA '98.

[22]  Mihalis Yannakakis,et al.  On the Complexity of Protein Folding , 1998, J. Comput. Biol..

[23]  Mihalis Yannakakis,et al.  On the complexity of protein folding (abstract) , 1998, RECOMB '98.

[24]  Satoru Miyano,et al.  On the Approximation of Protein Threading , 1999, Theor. Comput. Sci..