An improved search algorithm for optimal multiple-sequence alignment

Journal of Artificial Intelligence Research

Volumn 23, Issue , 2005, Pages 587-623

  Schroedl, Stefan ^a  

^a NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATABASE SYSTEMS; HEURISTIC METHODS; OPTIMAL CONTROL SYSTEMS; SET THEORY;

COMPUTATIONAL BIOLOGY; HEURISTIC SEARCH; HIRSCHBERG'S ALGORITHM; MULTIPLE SEQUENCE ALIGNMENT (MSA);

PROBLEM SOLVING;

EID: 27344439683     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1534     Document Type: Article

References (29)

1. Altschul, S., Gish, W., Miller, W., Myers, E., & Lipman, D. (1990). Basic local alignment search tool. Journal of Molecular Biology, 215, 403-410.
2. Altschul, S. F. (1989). Gap costs for multiple sequence alignment. Journal of Theoretical Biology, 138, 297-309.
3. Carrillo, H., & Lipman, D. (1988). The multiple sequence alignment problem in biology. SIAM Journal of Applied Mathematics, 5(48), 1073-1082.
4. Chan, S. C., Wong, A. K. C., & Chiu, D. K. Y. (1992). A survey of multiple sequence comparison techniques. Bulletin of Mathematical Biology, 54(4), 563-598.
5. Culberson, J. C., & Schaeffer, J. (1998). Pattern databases. Computational Intelligence, 14(4), 318-334.
6. Davidson, A. (2001). A fast pruning algorithm for optimal sequence alignment. In Proceedings of The 2nd IEEE International Symposium on Bioinformatics and Bioengineering (BIBE'2001), pp. 49-56.
7. Dayhoff, M. O., Schwartz, R. M., & Orcutt, B. C. (1978). A model of evolutionary change in proteins. In Dayhoff, M. O. (Ed.), Atlas of Protein Sequence and Structure, pp. 345-352, Washington, B.C. National Biomedical Research Foundation.
8. Dial, R. B. (1969). Shortest-path forest with topological ordering. Comm. ACM, 12(11), 632-633.
9. Dijkstra, E. W. (1959). A note on two problems in connection with graphs.. Numerische Mathematik, 1, 269-271.
10. Gupta, S., Kececioglu, J., & Schaeffer, A. (1995). Improving the practical space and time efficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignment. J. Computational Biology, 2(3), 459-472.
11. Gusfield, D. (1993). Efficient methods for multiple sequence alignment with guaranteed error bounds. Bull, of Math. Biol., 55(1), 141-154.
12. Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for heuristic determination of minimum path cost. IEEE Trans. on Systems Science and Cybernetics, 4, 100-107.
13. Hirschberg, D. S. (1975). A linear space algorithm for computing maximal common subsequences. Comm. ACM, 6(18), 341-343.
14. Ikeda, T., & Imai, H. (1994). Fast A* algorithms for multiple sequence alignment. In Proceedings of the Genome Informatics Workshop, pp. 90-99.
15. Jones, D. T., Taylor, W. R., & Thornton, J. M. (1992). The rapid generation of mutation data matrices from protein sequences. CABIOS, 3, 275-282.
16. Kobayashi, H., & Imai, H. (1998). Improvement of the A* algorithm for multiple sequence alignment. In Miyano, S., & Takagi, T. (Eds.), Genome Informatics, pp. 120-130, Tokyo. Universal Academy Press.
17. Korf, R. E. (1985). Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1), 97-109.
18. Korf, R. E. (1999). Divide-and-conquer bidirectional search: First results. In Proceedings of the Sixteenth International Conference on Artificial Intelligence (IJCAI-99), pp. 1181-1189, Stockholm, Sweden.
19. Korf, R. E., & Zhang, W. (2000). Divide-and-conquer frontier search applied to optimal sequence alignment. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-00), pp. 210-216.
20. McNaughton, M., Lu, P., Schaeffer, J., & Szafron, D. (2002). Memory-efficient A* heuristics for multiple sequence alignment. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-02), Edmonton, Alberta, Canada.
21. Spouge, J. L. (1989). Speeding up dynamic programming algorithms for finding optimal lattice paths. SIAM J. Applied Mathematics, 49(5), 1552-1566.
22. Thompson, J. D., Plewniak, F., & Poch, O. (1999). A comprehensive comparison of multiple sequence alignment programs. Nucleic Acids Res., 13(27), 2682-2690.
23. Ukkonen, E. (1985). Algorithms for approximate string matching. Information and Control, 64, 110-118.
24. Wah, B. W., & Shang, Y. (1995). A comparison of a class of IDA* search algorithms. International Journal of Tools with Artificial Intelligence, 3(4), 493-523.
25. Wang, L., & Jiang, T. (1994). On the complexity of multiple sequence alignment. Journal of Computational Biology, 1, 337-348.
26. Yoshizumi, T., Miura, T., &: Ishida, T. (2000). A* with partial expansion for large branching factor problems. In AAAI/IAAI, pp. 923-929.
27. Zhou, R., & Hansen, E. A. (2003a). Sparse-memory graph search. In 18th International Joint Conference on Artificial Intelligence (IJCAI-03), Acapulco, Mexico.
28. Zhou, R., & Hansen, E. A. (2003b). Sweep A*: Space-efficient heuristic search in partially-ordered graphs. In 15th IEEE International Conference on Tools with Artificial Intelligence, Sacramento, CA.
29. Zhou, R., & Hansen, E. A. (2004). Breadth-first heuristic search. In Fourteenth International Conference on Automated Planning and Scheduling (ICAPS-04), Whistler, BC, Canada.