Reducing the computational load of energy evaluations for protein folding

Proceedings - Fourth IEEE Symposium on Bioinformatics and Bioengineering, BIBE 2004

Volumn , Issue , 2004, Pages 79-86

  Santos, Eunice E ^a   Santos Jr , Eugene ^b  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

^b University of Connecticut   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CACHING APPROACH; COMPUTATIONAL PROTEIN MODELS; ENERGY EVALUATION; PROTEIN FOLDING;

APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONFORMATIONS; EVOLUTIONARY ALGORITHMS; HYDROPHILICITY; HYDROPHOBICITY; LATTICE CONSTANTS; OPTIMIZATION;

PROTEINS;

EID: 4544347767     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BIBE.2004.1317328     Document Type: Conference Paper

References (12)

1. R. Agarwala, S. Batzoglou, V. Dancik, S. Decatur, M. Farach, S. Hannenhali, S. Muthukrishnan, and S. Skiena. Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the hp model. Journal of Computational Biology, 4(2):275-296, 1997.
2. B. Berger and T. Leighton. Protein folding in the hydrophobic-hydrophilic (hp) model is np-complete. Journal of Computational Biology, 5(1):27-40, 1998.
3. B. Blackburne and I. Hirst. Evolution of functional model proteins. J of Chemical Physics, 115(4): 1934-1942, 2001.
4. E. Bornberg-Bauer. Simple folding model for hp lattice proteins. In Proceedings of Bioinfomatics German Conference on Bioinformatics GCB '96, pages 125-136, 1997.
5. P. Crescenzi, D. Goldman, C. Piccolboni, and M. Yannakanis. On the complexity of protein folding. Journal of Computational Biology, 5(3):423-465, 1998.
6. K. Dill, S. Bomberg, K. Yue, K. Fiebig, D. Yee, P. Thomas, and H. Chan. Principles of protein folding: A perspective from simple exact models. Protein Sci, 4:561-602, 1995.
7. W. Hart and S. Istrail. Fast protein folding in the hydrophobic-bydrophilic model within three-eighths of optimal. In Proceedings of Twenty-seventh Annual ACM Symposium on Theory of Computing, pages 157-168, 1995.
8. N. Krasnogor, B. Blackburnem, J. Hirst, and E. Burke. Multimeme algorithms for protein structure prediction. In Lecture Notes in Computer Science: Proceedings of Parallel Problem Solving From Nature, 2002.
9. M. Milostan, P. Lukasiak, K. Dill, and J. Blazewicz. A tabu search strategy for finding low energy structures of proteins in hp-model. In RECOMB Poster Proceedings, 2003.
10. E. E. Santos and E. Santos, Jr. Effective and efficient caching in genetic algorithms. International Journal of Artificial Intelligence Tools, 10(1-2):273-301, 2001.
11. A. Shmygelska, R. Aguirre-Hernndez, and H. Hoos. An ant colony optimization algorithm for the 2d hp protein folding problem. In Proceedings of the Third International Workshop, ANTS 2002, Springer's Lecture Notes in Computer Science (LNCS) series, Vol. 2463, 2002.
12. R. Unger and J. Moult. Genetic algorithms for protein folding simulations. Journal of Molecule Biology, 231:75-81, 1993.