A 2O(n1-1/d log n) time algorithm for d-dimensional protein folding in the HP-model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3142, Issue , 2004, Pages 630-644

  Fu, Bin ^a,b   Wang, Wei ^c  

^a USA   (United States)

^b The Research Institute for Children at Children's Hospital New Orleans   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GRAPH THEORY; PROTEIN FOLDING; PROTEINS; SEPARATORS;

COMPUTATIONAL TIME; D-DIMENSIONAL GRIDS; GRID POINTS; PLANAR GRAPH; PROTEIN FOLDING PROBLEM; SEPARATOR THEOREMS; TIME ALGORITHMS; UPPER BOUND;

ALGORITHMS;

EID: 35048887620     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_54     Document Type: Article

References (28)

1. R. Agarwala, S. Batzoglou, V. Dancik, SE. Decatur , S. Hannenhalli, M. Farach, M. Muthukrishnan, S. Skiena, Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model. Journal of Computational Biology 4: 275-296, 1997.
2. N. Alon, P. Seymour, and R. Thomas, Planar Separator, SIAM J. Discr. Math. 7,2(1990) 184-193.
3. R. Backofen, Constraint techniques for solving the protein structure prediction problem, Proceedings of 4th International conference on principle and practice of constrain programming, 1998, Lecture Notes in Computer Science, 72-86, Springer-Verlag.
4. B. Berger and T. Leighton, Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete, Journal of Computational Biology, 5(1998), 27-40.
5. F. E. Cohen and M. J. E. Sternberg, On the prediction of. protein structure: the significance of the root-mean-square deviation, J. Mol. Biol., 138(1980), 321-333.
6. P. Crescenzi and D. Goldman and C. Papadimitriou and A. Piccolboni and M. Yannakakis, On the complexity of protein folding, Journal of computational biology, 5(1998), 423-465.
7. U. Bastolla, H. Frauenkron, E. Gerstner, P. Grassberger, and Nadler, Testing a new Monte Carlo algorithm for protein folding, Protein: Structure, Function, and Genetics, 32(1998), 52-66.
8. A. Godzik and J. Skolnick and A. Kolinski, Regularities in interaction patterns of globular proteins, Protein Engineering, 6(1993), 801-810.
9. A. Godzik and J. Skonick and A. Kolinski, A topology fingerprint approach to inverse protein folding problem, J. Mol. Biol., 227(1992), 227-238.
10. W. E. Hart and S. Istrail, Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal, Proceedings 27th ACM symposium on the theory of computing, 1995.
11. L. Holm and C. Sander, Mapping the protein universe, Science, 273(1996), 595-602.
12. M. Khimasia and P.Coveney, Protein structure prediction as a hard optimization problem: The genetic algorithm approach, In Molecular Simulation, 19(1997), 205-226.
13. N. Krasnogor, D. Pelta, P.M. Lopez, P.Mocciola, and E. De la Canal, Genetic algorithms for the protein folding problem: A critical view, In C.F.E. Alpaydin, editor, Proceedings of Engineering of Intelligent Systems. ICSC Academic Press, 1998.
14. K. F. Lau and K. A. Dill, A lattice statistical mechanics model of the conformational and sequence spaces of proteins, Macromolecules, 22(1989), 3986-3997.
15. K. F. Lau and K. A. Dill, Theory for protein mutability and biogenesis, Proc. Natl. Acad. Sci, 87(1990), 638-642.
16. R. J. Lipton and R. Tarjan, A separator theorem for planar graph, SIAM J. Appl. Math. 36(1979) 177-189.
17. F. Liang and W.H. Wong, Evolutionary Monte Carlo for Protein folding simulations, Journal of Chemical Physics, 115,7(2001), 3374-3380.
18. A. Newman, A new algorithm for protein folding in the HP model, Proceedings 13th ACM-SIAM Symposium on Discrete Algorithms, 2002, 876-884.
19. A. Patton, W.P.III, and E. Goldman, A standard ga approach to native protein conformation prediction, In Proc 6th Intl Conf Genetic Algorithms, Morgan Kauffman, 1995, 574-581.
20. J. Pach and P.K. Agarwal, Combinatorial Geometry, Wiley-Interscience Publication, 1995.
21. A. Piccolboni and G. Mauri, Application of evolutionary algorithms to protein prediction, In N. e. a. Kasabov, editor, Proceedings of I-CONIP'97, Springer, 1998.
22. A.A. Rabow and H.A. Scheraga, Improved genetic algorithm for the protein folding problem by use of a cartesian combination operator. Protein Science, 5(1996), 1800-1815.
23. R. Ramakrishnan, B. Ramachandran, and J.F. Pekney, A dynamic Monte Carlo algorithm for exploration of dense conformation spaces in heteropolymers, Journal of Chemical Physics, 106(1997), 2418.
24. W. D. Smith and N. C. Wormald, Application of geometric separator theorems, FOCS 1998, 232-243.
25. A. Sali, E. Shakhnovich, M. Karplus, How does a protein fold? Nature, 369(1994), 248-251.
26. U. Unger and J. Moult, A Genetic algorithm for three dimensional protein folding simulations, In Proc 5th Intl Conf on Genetic Algorithms, 1993, 581-588.
27. U. Unger and J. Moult, Genetic algorithms for protein folding simulations, Journal of Molecular Biology, 1993, 231(1),75-81
28. K. Yue and K. A. Dill, Sequence-structure relationships in proteins and copolymers, Physical Review E48(1993), 2267-2278.