Comparing best-first search and dynamic programming for optimal multiple sequence alignment

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 1239-1245

  Hohwald, Heath ^a   Thayer, Ignacio ^a   Korf, Richard E ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEST FIRST SEARCH; BOUNDED DYNAMIC PROGRAMMING; COMPUTATIONAL BIOLOGY; DIVIDE AND CONQUER; HIGHER-DIMENSIONAL PROBLEMS; MULTIPLE SEQUENCE ALIGNMENTS; SEQUENCE ALIGNMENTS; SPACE REQUIREMENTS;

ARTIFICIAL INTELLIGENCE; BIOINFORMATICS; DISPERSION COMPENSATION;

DYNAMIC PROGRAMMING;

EID: 0344145172     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. E.W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
2. R. Durbin, S. Eddy, A. Krogh, and G. Mitchison. Biological sequence analysis. Cambridge University Press, 1998. ISBN: 0-521-62971-3.
3. P.E. Hart, N.J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Systems Science and Cybernetics, SSC-4(2):100-107, July 1968.
4. D. S. Hirschberg. A linear space algorithm for computing longest common subsequences. Communications of the ACM, 18:341-343, 1975.
5. D. S. Hirschberg. Serial computations of Lcvenshtein distances. In A. Apostolico and Z. Galil, editors, Pattern matching algorithms, chapter 4, pages 123-141. Oxford University Press, 1997.
6. Richard E. Korf and Weixiong Zhang. Divide-and-conquer frontier search applied to optimal sequence alignment. In Proceedings of the 7th Conference on Artificial Intelligence (AAAI-00) and of the 12th Conference on Innovative Applications of Artificial Intelligence (IAAI-00), pages 910-916, Menlo Park, CA, July 30-3 2000. AAA1 Press.
7. Richard E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1) :97-109, 1985.
8. 1 for Modern Applications, P.G. Raeth (Ed.), IEEE Computer Society Press, Washington D.C., 1990, pp. 380-389.
9. Richard E. Korf. A divide and conquer bidirectional search: First results. In Dean Thomas, editor, Proceedings of the 16 th International Joint Conference on Artificial Intelligence (IJCAI-99-Vol2), pages 11184-1191, S.F.,July 31-August6 1999. Morgan Kaufmann Publishers.
10. Matthew McNaughton, Paul Lu, Jonathan Schaeffer, and Duane Szafron. Memory-efficient A* heuristics for multiple sequence alignment. Proceedings of the Eighteenth National Conference on Artificial Intelligence, July-August 2002.
11. S. B. Needleman and C. D. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol Biol, 48:443-453,1970.
12. J. L. Spouge. Speeding up dynamic programming algorithms for finding optimal lattice paths. SIAMJ. Appi Math., 49(5): 1552-1566, October 1989.
13. J.D. Thomson, F. Plewniak, and O. Poch. BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics, 15(I):87-88, 1999. (Pubitemid 29101202)
14. E. Ukkonen. Algorithms for approximate string matching. Information and Control, 64:100-118, 1985.
15. M. S. Waterman. Introduction to Computational Biology. Chapman & Hall, 1995.
16. Weixiong Zhang. Personal communication, August 2002.