Divide-and-conquer bidirectional search: First results

IJCAI International Joint Conference on Artificial Intelligence

Volumn 2, Issue , 1999, Pages 1184-1189

  Korf, Richard E ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BI-DIRECTIONAL SEARCH; COMPUTATIONAL BIOLOGY; CONSTANT FACTORS; D-DIMENSIONAL GRIDS; DIVIDE AND CONQUER; HEURISTIC SEARCH; INTERMEDIATE NODE; MEMORY REQUIREMENTS;

BIOINFORMATICS; HEURISTIC ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

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

References (11)

1. Carrillo, H., and D. Liprnan, The multiple sequence alignment problem in biology, SI AM Journal of Applied Mathematics, Vol. 48, No. 5, October 1988, pp. 1073-1082.
2. Dijkstra, E.W., A note on two problems in connexion with graphs, Numerische Mathematik, Vol. 1, 1959, pp. 269-71.
3. Hirschberg, D.S., A linear space algorithm for computing maximal common subsequences, Communications of the ACM, Vol. 18, No. 6, June, 1975, pp. 341-343.
4. Hart, P.E., N.J. Nilsson, and B. Raphael, A formal basis for the heuristic determination of minimum cost paths, IEEE Transactions on Systems Science and Cybernetics, Vol. SSC-4, No. 2, July 1968, pp. 100-107.
5. Ikeda, T., and H. Imai, Enhanced A* algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases, Theoretical Computer Science, Vol. 210, 1998.
6. Kernighan, B.W., and D.M. Ritchie, The C Programming Language, second edition, Prentice Hall, Englewood Cliffs, N.J., 1988.
7. Korf, R.E., Space-efficient search algorithms, Computing Surveys, Vol. 27, No. 3, Sept., 1995, pp. 337- 339.
8. Korf, R.E., Depth-first iterative-deepening: An optimal admissible tree search, Artificial Intelligence, Vol. 27, No. 1, 1985, pp. 97-109.
9. Korf, R.E., and D.M. Chickering, Best-first minimax search, Artificial Intelligence, Vol. 84, No. 1-2, July 1996, pp. 299-337. (Pubitemid 126365328)
10. Miura, T., and T. Ishida, Stochastic node caching for memory-bounded search, Proceedings of the National Conference on Artificial Intelligence (AAAI- 98), Madison, W I, July, 1998, pp. 450-456.
11. Taylor, L., and R.E. Korf, Pruning duplicate nodes in depth-first search, Proceedings of the National Conference on Artificial Intelligence (AAAI-93), Washington D.C., July 1993, pp.* 756-761.