Delta: A toolset for the structural analysis of biological sequences on a 3D triangular lattice

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

Volumn 4463 LNBI, Issue , 2007, Pages 518-529

  Jiang, Minghui ^a   Mayne, Martin ^a   Gillespie, Joel ^a  

^a Utah State University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; PROTEINS; RNA; STRUCTURAL ANALYSIS;

BIOLOGICAL SEQUENCES; SECONDARY STRUCTURES; TRIANGULAR LATTICES;

BIOINFORMATICS;

EID: 34547481857     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-72031-7_47     Document Type: Conference Paper

References (37)

1. J. P. Abrahams, M. van den Berg, E. van Batenburg, and C. Pleij, Prediction of RNA secondary structure, including pseudoknotting, by computer simulation. Nucleic Acids Research, 18(10):3035-3044, 1990.
2. R. Agarwala, S. Batzoglou, V. Dančík, S. E. Decatur, M. Farach, S. Hannenhalli, and S. Skiena. Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'97), pages 390-399, 1997.
3. T. Akutsu. Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots. Discrete Applied Mathematics, 104(1-3):45-62, 2000.
4. F. H. D. van Batenburg, A. P. Gultyaev, and C. W. A. Pleij. An APL-programmed genetic algorithm for the prediction of RNA secondary structure. Journal of Theoretical Biology, 174(3):269-280, 1995.
5. F. H. D. van Batenburg, A. P. Gultyaev, C. W. A. Pleij, J. Ng, and J. Oliehoek. Pseudobase: a database with RNA pseudoknots. Nucleic Acids Research, 28(1):201-204, 2000.
6. B. Berger and T. Leighton. Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete. In Proceedings of the 2nd Conference on Computational Molecular Biology (RECOMB'98), pages 30-39, 1998.
7. P. Crescenzi, D. Goldman, C. Papadimitriou, A. Piccolboni, and M. Yannakakis. On the complexity of protein folding. In Proceedings of the 2nd Conference on Computational Molecular Biology (RECOMB'98), pages 61-62,
8. and in Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC'98), pages 597-603, 1998.
9. M. Crochemore, D. Hermelin, G. M. Landau, and S. Vialette. Approximating the 2-interval pattern problem. In Proceedings of the 13th Annual European Symposium on Algorithms (ESA'05), LNCS 3669, pages 426-437, 2005.
10. J. S. Deogun, R. Donis, O. Komina, and F. Ma. RNA secondary structure prediction with simple pseudoknots. In Proceedings of the 2nd Asia-Pacific Bioinformatics Conference (APBC'04), pages 239-246, 2004.
11. K. A. Dill. Theory for the folding and stability of globular proteins. Biochemistry, 24(6):1501-1509, 1985.
12. K. A. Dill. Dominant forces in protein folding. Biochemistry, 29:7133-7155, 1990.
13. S. R. Eddy. How do RNA folding algorithms work? Nature Biotechnology, 22(11):1457-1458, 2004.
14. A. P. Gultyaev, F. H. D. van Batenburg, and C. W. A. Pleij. The computer simulation of RNA folding pathways using a genetic algorithm. Journal of Molecular Biology, 250(1):37-51, 1995.
15. W. E. Hart and S. Istrail. Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal. In Proc. 27th Annual ACM Symposium on Theory of Computing (STOC'95), pages 157-168, 1995.
16. I. L. Hofacker, W. Fontana, P. F. Stadler, S. Bonhoeffer, M. Tacker, and P. Schuster. Fast folding and comparison of RNA secondary structures. Monatshefte für Chemie, 125(2): 167-188, 1994.
17. S. Ieong, M.-Y. Kao, T.-W. Lam, W.-K. Sung, and S.-M. Yiu. Predicting RNA secondary structure with arbitrary pseudoknots by maximizing the number of stacking pairs. Journal of Computational Biology, 10(6):981-995, 2003.
18. M. Jiang. A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem. Journal of Combinatorial Optimization, Special Issue on Bioinformatics, to appear.
19. M. Jiang. Improved approximation algorithms for predicting RNA secondary structures with arbitrary pseudoknots. In Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM'7), to appear.
20. M. Jiang and B. Zhu. Protein folding on the hexagonal lattice in the HP model. Journal of Bioinformatics and Computational Biology, 3(1):19-34, 2005.
21. S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi. Optimization by simulated annealing. Science, 220(4598):671-680, 1983.
22. N. Lesh, M. Mitzenmacher, and S. Whiteslides. A complete and effective move set for simplified protein folding. In Proceedings of the 7th Annual International Conference on Computational Molecular Biology (RECOMB'03), pages 188-195, 2003.
23. R. B. Lyngsø. Complexity of pseudoknot prediction in simple models. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP'04), pages 919-931, 2004.
24. R. B. Lyngsø and C. N. S. Pedersen. RNA pseudoknot prediction in energy-based models. Journal of Computational Biology, 7(3/4):409-427, 2000.
25. R. B. Lyngsø, M. Zuker, and C. N. S. Pedersen. Fast evaluation of interval loops in RNA secondary structure prediction. Bioinformatics, 15(6):440-445, 1999.
26. G. Mauri, G. Pavesi, and A. Piccolboni. Approximation algorithms for protein folding prediction. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), pages 945-946, 1999.
27. A. Newman. A new algorithm for protein folding in the HP model. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02), pages 876-884, 2002.
28. R. Nussinov, G. Pieczenik, J. R. Griggs, and D. J. Kleitman. Algorithms for loop matching. SIAM Journal on Applied Mathematics, 35(1):68-82, 1978.
29. E. Rivas and S. R. Eddy. A dynamic programming algorithm for RNA structure prediction including pseudoknots. Journal of Molecular Biology, 285:2053-2068, 1999.
30. J. Ruan, G. D. Stormo, and W. Zhang. An iterated loop matching approach to the prediction of RNA secondary structure with pseudoknots. Bioinformatics, 20(1):58-66, 2004.
31. B. A. Shapiro and J. C. Wu. Predicting RNA H-type pseudoknots with the massively parallel genetic algorithm Computer Applications in the Biosciences, 13(4):459-471, 1997.
32. J. E. Tabaska, R. B. Cary, H. N. Gabow, and G. D. Stormo. An RNA folding method capable of identifying pseudoknots and base triples. Bioinformatics, 14(8):691-699, 1998.
33. I. Tinoco, P. N. Borer, B. Dengler, M. D. Levine, O. C. Uhlenbeck, D. M. Crothers, and J. Gralla. Improved estimation of secondary structure in ribonucleic acids. Nature New Biology, 246:40-42, 1973.
34. Y. Uemura, A. Hasegawa, S. Kobayashi, and T. Yokomori. Tree adjoining grammars for RNA structure prediction. Theoretical Computer Science, 210(2):277-303, 1999.
35. S. Vialette. On the computational complexity of 2-interval pattern matching problems. Theoretical Computer Science, 312:223-249, 2004.
36. M. S. Waterman. Introduction to Computational Biology: Maps, Sequences and Genomes. Chapman & Hall, 1995.
37. M. Zuker and P. Stiegler. Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information. Nucleic Acids Research, 9(1):133-148, 1981.