On the complexity of protein folding (extended abstract)

forefront of today’s science (often referred to dramatically as “breaking the genetic code” or “the last phase of the We ahow that the protein folding problem in the two-dimensional Mendelian revolution”). This mapping cm be rou&ly &H-P model io NP-complete.

[1]  K. Dill.  Dominant forces in protein folding. , 1990, Biochemistry.

[2]  Luca Trevisan,et al.  When Hamming meets Euclid: the approximability of geometric TSP and MST (extended abstract) , 1997, STOC '97.

[3]  R. Unger,et al.  Finding the lowest free energy conformation of a protein is an NP-hard problem: proof and implications. , 1993, Bulletin of mathematical biology.

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

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

[6]  Steven Skiena,et al.  Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model , 1997, RECOMB '97.

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

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

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

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

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

[12]  Frank Thomson Leighton,et al.  Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete , 1998, RECOMB '98.

[13]  J. King,et al.  Deciphering the Rules of Protein Folding , 1989 .

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