On the complexity of protein folding

Journal of Computational Biology

Volumn 5, Issue 3, 1998, Pages 423-465

  Crescenzi, Pierluigi ^a   Goldman, Deborah ^b   Papadimitriou, Christos ^c   Piccolboni, Antonio ^d   Yannakakis, Mihalis ^e  

^a UNIVERSITY OF FLORENCE   (Italy)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d UNIVERSITY OF MILAN   (Italy)

^e LUCENT TECHNOLOGIES   (United States)

Author keywords

Computational complexity; Protein folding

Indexed keywords

COMPUTER PROGRAM; CONFERENCE PAPER; MATHEMATICAL ANALYSIS; MATHEMATICAL MODEL; MOLECULAR MODEL; PREDICTION; PRIORITY JOURNAL; PROTEIN FOLDING; PROTEIN TERTIARY STRUCTURE; SYSTEM ANALYSIS;

EID: 0031721615     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.1998.5.423     Document Type: Conference Paper

References (14)

1. Berger, B., and Leighton, F.T. 1997. Manuscript submitted. Journal of Computational Biology, July.
2. Chan, H.S., and Dill, K.A. 1993. The protein folding problem. Physics Today 24-32.
3. Dill, K.A., Bromberg, S., Yue, K., Fiebig, K., Yee, D.P., Thomas, P.D., and Chan, H.S. 1995. Principles of protein folding - a perspective from simple exact models. Protein Science 561-602.
4. Dill, K.A. 1990. Dominant forces in protein folding. Biochemistry 29, 7133-7155.
5. Fraenkel, A.S. 1993. Complexity of protein folding. Bulletin of mathematical Biology 55(6), 1199-1210.
6. Hart, W.E., and Istrail, S. 1995. Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal. Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (STOC 95), 157-168.
7. Johnson, D.S., and Papadimitriou, C.H. 1985. Computational complexity. In: Lawler, E.L., Lenstra, J.K., Kan, A.H.G. Rinooy, and Shmoys, D.B. (eds.). The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization. Wiley Interscience.
8. Khalimsky, E., Kopperman, R., and Meyer, P.R. 1990. Computer graphics and connected topologies on finite oredered sets. Topology and its Applications 36, 1-17.
9. King, J. 1989, Deciphering the rules of protein folding. Chemical Engineering News 67, 32-54.
10. Nayak, A., Sinclair, A., and Zwick, U. 1998. Spatial codes and the hardness of string folding. In: Proceedings of the acm-siam symposium on discrete algorithms. To appear.
11. Ngo, T., Marks, J., and Karplus. 1994. The Protein Folding Problem and Tertiary Structure Prediction. Birkhauser. 435-508.
12. Paterson, M., and Przytycka, T. 1996. On the complexity of string folding. Discrete Applied Mathematics 71, 217-230.
13. Trevisan, L. 1996. When Hamming meets Euclid: The approximability of geometric TSP and MST. In: Proceeding of the 28th Symposium on the Theory of Computing.
14. Unger, R., and Moult, J. 1993. Finding the lowest free energy conformation of a protein in an NP-hard problem: Proof and implications. Bulletin of Mathematical Biology 55(6), 1183-1198.