The algorithmics of folding proteins on lattices

Discrete Applied Mathematics

Volumn 127, Issue 1 SPEC., 2003, Pages 145-161

  Chandru, Vijay ^a,b   Dattasharma, Abhi ^c   Kumar, V S Anil ^d  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b Strand Genomics Pvt Ltd ^*  (India)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^d LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONFORMATIONS; FORECASTING;

COMPUTATIONAL CHEMISTS; COMPUTATIONAL COMPLEXITY THEORY; CROSS-DISCIPLINARY; DISCRETE LATTICES; MINIMUM ENERGY; NATIVE CONFORMATION; OPTIMIZATION PROBLEMS; PROTEIN STRUCTURE PREDICTION;

PROTEINS;

EID: 0037375248     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00381-5     Document Type: Article

References (33)

1. R. Agarwala, S. Batzogloa, V. Dancik, S.E. Decatur, S. Hannenhalli, M. Farach, S. Muthukrishnan, S. Skiena, Local rules for protein folding on a triangular lattice and generalised hydrophobicity, RECOMB (1997) 1-2.
2. J Atkins, and W.E Hart On the intractability of protein folding with a finite alphabet of amino acids Algorithmica 25 1999 279 294
3. R. Backofen, The protein structure prediction problem: a constraint optimisation approach using a new lower bound, J. Constraints (2000).
4. B Berger, and T Leighton Protein folding in the hydrophobic-hydrophilic model is NP complete J. Comput. Biol. 5 1998 27 40
5. L.T. Biegler, T.F. Coleman, A.R. Conn, F.N. Santosa (Eds.), Large scale optimization with applications, Part III: molecular structure and optimization, IMA Vol. Math. Appl. 94 (1997).
6. S. Bromberg, K. Dill, Side chain entropy and packing in proteins, Protein Sci. 3 (1994) 997-1009.
7. V Chandru, S Ganesh, and M.R Rao Folding proteins on lattices: an integer programming approach M Groetschel, Festschrift for Professor Manfred Padberg 2002 Springer Berlin
8. P. Clote, Protein folding, the Levinthal paradox and rapidly mixing Markov chains, ICALP. Springer Lecture Notes in Computer Science 1644 (1999) 240-249.
9. P Crescenzi, D Goldman, C Papadimitrou, A Piccolboni, and M Yannakakis On the complexity of protein folding J. Comput. Biol. 5 1998 423 446
10. K.A Dill Biochemistry 24 1985 1501
11. K.A Dill, S Bromberg, K Yue, K.M Fiebig, D.P Yee, P.D Thomas, and H.S Chan Principles of protein folding a perspective from simple exact models Protein Sci. 4 1995 561 602
12. A.S. Fraenkel, Complexity of protein folding, Bull. Math. Biol. 55 (1993) 1199-1210.
13. M.R Garey, and D.S Johnson Computers and Intractability - A Guide to the Theory of NP-Completeness 1979 Freeman San Francisco, CA
14. W.E Hart, and S Istrail Fast protein folding in the hydrophobic- hydrophilic model within three-eights of optimal J. Comput. Biol. 3 1996 53 96
15. W.E Hart, and S Istrail Robust Proofs of NP-hardness for protein folding general lattices and energy potentials J. Comput. Biol. 4 1 1997 1 22
16. W.E Hart, and S Istrail Lattice and off-lattice side chain models of protein folding linear time structure prediction better than 86% of optimal J. Comput. Biol. 4 3 1997 241 259
17. V. Heun, Approximate protein folding in the HP side chain model on extended cubic lattices, Proceedings of the European Symposium on Algorithms, 1999.
18. K.F Lau, and K.A Dill A lattice statistical mechanics model of the conformation and sequence spaces of proteins Macromolecules 22 1989 3986 3997
19. K.F Lau, and K.A Dill Theory for protein mutability and biogenesis Proc. Natl Acad. Sci. USA 87 1990 638 642
20. D Lipman, and J Wilber Proc. Roy. Soc. London 245 8 1991
21. A. Newman, A new algorithm for protein folding in the HP model, in: Proceedings of the 13th ACM-SIAM, Symposium on Discrete Algorithms, 2002.
22. J.T Ngo, and J Marks Computational complexity of a problem in molecular-structure prediction Protein Eng. 5 4 1992 313 321
23. J.T Ngo, J Marks, and M Karplus Computational Complexity, Protein Structure Prediction and the Levinthal Paradox 1994 Birkhauser Basel
24. A. Nayak, A. Sinclair, U. Zwick, Spatial codes and the hardness of string folding problems, Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 639-648.
25. P.M. Pardalos, D. Shalloway, G.L. Xue, (Eds.), Global minimization of nonconvex energy functions: molecular conformation and protein folding, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1996. Vol. 23, American Mathematical Society.
26. M Paterson, and T Przytycka On the complexity of string folding Discrete Appl. Math. 71 1996 217 230
27. A Šali, E Shakhnovich, and M Karplus How does a protein fold? Nature 369 1994 248 251
28. A Šali, E Shakhnovich, and M Karplus Kinetics of protein folding a lattice model study of the requirements for folding to the native state J. Mol. Biol. 235 1994 1614 1636
29. A Sinclair Algorithms for Random Generation and Counting: A Markov Chain Approach 1993 Birkhäuser Basel
30. R Unger, and J Moult Finding the lowest free energy conformation of a protein is a NP-hard problem: proof and implications Bull. Math. Biol. 55 1993 1183 1198
31. R Unger, and J Moult Genetic algorithms for protein folding simulations J. Mol. Biol. 231 1 1993 75 81
32. R. Unger, J. Moult, A genetic algorithm for three dimensional protein folding simulations, Proceedings of the 5th International Conference on Genetic Algorithms, 1993, pp. 581-588.
33. K Yue, and K Dill Folding proteins with a simple energy function and extensive conformational searching Protein Sci. 5 1996 254 261