Frontier search

Journal of the ACM

Volumn 52, Issue 5, 2005, Pages 715-748

  Korf, Richard E ^a,c   Zhang, Weixiong ^b   Thayer, Ignacio ^a,d   Hohwald, Heath ^a,e  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b WASHINGTON UNIVERSITY   (United States)

^c University of California   (United States)

^d GOOGLE INC   (United States)

^e Google Inc ^*  (United States)

Author keywords

A* algorithm; Best first search; Bidirectional search; Breadth first search; Dijkstra's algorithm; Heuristic search; Sequence alignment; Sliding tile puzzles; Towers of Hanoi

Indexed keywords

BIOTECHNOLOGY; COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; PROBLEM SOLVING; SPACE RESEARCH;

A; ALGORITHM; BEST-FIRST SEARCH; BIDIRECTIONAL SEARCH; BREADTH-FIRST SEARCH; DIJKSTRA'S ALGORITHM; HEURISTIC SEARCH; SEQUENCE ALIGNMENT; SLIDING-TILE PUZZLES; TOWERS OF HANOI;

ALGORITHMS;

EID: 27344440407     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/1089023.1089024     Document Type: Article

References (51)

1. ARAKI, S., GOSHIMA, M., MORI, S., NAKASHIMA, H., AND TOMITA, S. 1999. Application of parallelized DP and A* algorithm to multiple sequence alignment. In Proceedings of the Genome Informatics Workshop IV, 94-102.
2. BODE, J.-P., AND HINZ, A. 1999. Results and open problems on the Tower of Hanoi. In Proceedings of the 30th Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL). Congressus Numerantium, Vol. 139. 112-122.
3. BRUNGGER, A., MARZETTA, A., FUKUDA, K., AND NIEVERGELT, J. 1999. The parallel search bench ZRAM and its applications. Ann. Oper. Res. 90, 45-63.
4. CHAKRABARTI, P., GHOSE, S., ACHARYA, A., AND DE SARKAR, S. 1989. Heuristic search in restricted memory. Artif. Intell. 41, 2 (Dec.), 197-221.
5. CULBERSON, J., AND SCHAEFFER, J. 1998. Pattern databases. Computat. Intell. 14, 3, 318-334.
6. DIJKSTRA, E. 1959. A note on two problems in connexion with graphs. Numer. Math. 1, 269-271.
7. DUDENEY, H. 1908. The Canterbury Puzzles (and Other Curious Problems). E.P. Dutton, New York.
8. DUNKEL, O. 1941. Editorial note concerning advanced problem 3918. Amer. Math. Month. 48, 219.
9. FELNER, A., KORF, R., AND HANAN, S. 2004. Additive pattern database heuristics. J. Artif. Intell. Res. 22, 279-318.
10. FELNER, A., MESHULAM, R., HOLTE, R., AND KORF, R. 2004. Compressing pattern databases. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-04) (San Jose, CA). 638-643.
11. FRAME, J. 1941. Solution to advanced problem 3918. Amer. Math. Month. 48, 216-217.
12. GHOSH, S., MAHANTI, A., AND NAU, D. 1994. ITS: An efficient limited-memory heuristic tree search algorithm. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94) (Seattle, WA). 1353-1358.
13. HART, P., NILSSON, N., AND RAPHAEL, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cyber. SSC-4, 2 (July), 100-107.
14. HIRSCHBERG, D. 1975. A linear space algorithm for computing maximal common subsequences. Commun. ACM 18, 6 (June), 341-343.
15. HIRSCHBERG, D. 1997. Serial computations of levenshtein distances. In Pattern Matching Algorithms, A. Apostolic and Z. Galil, Eds. Oxford University Press, Oxford, England, 123-141.
16. HOHWALD, H., THAYER, I., AND KORF, R. 2003. Comparing best-first search and dynamic programming for optimal multiple sequence alignment. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03) (Acapulco, Mexico). 1239-1245.
17. IKEDA, T., AND IMAI, H. 1999. Enhanced A* algorithms for multiple alignments: Optimal alignments for several sequences and k-opt approximate alignments for large cases. Theoret. Comput. Sci. 210, 341-374.
18. JOHNSON, W., AND STOREY, W. 1879. Notes on the 15 Puzzle. Amer. J. Math. 2, 397-404.
19. KAINDL, H., AND KAINZ, G. 1997. Bidirectional heuristic search reconsidered. J. Artif. Intell. Res. 7, 283-317.
20. KLAVZAR, S., AND MILUTINOVIC, U. 2002. Simple explicit formulas for the Frame-Stewart numbers. Ann. Combinat. 6, 157-167.
21. KORF, R. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artif. Intell. 27, 1 (Sept.), 97-109.
22. KORF, R. 1993. Linear-space best-first search. Artif. Intell. 62, 1 (July), 41-78.
23. KORF, R. 1999. Divide-and-conquer bidirectional search: First results. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99) (Stockholm, Sweden). 1184-1189.
24. KORF, R. 2003. Delayed duplicate detection: Extended abstract. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03) (Acapulco, Mexico). 1539-1541.
25. KORF, R. 2004. Best-first frontier search with delayed duplicate detection. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-2004) (San Jose, CA). 650-657.
26. KORF, R. 2005. Large-scale parallel breadth-first search. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-2005) (Pittsburgh, PA), 1380-1385.
27. KORF, R., AND CHICKERING, D. 1996. Best-first minimax search. Artif. Intell. 84, 1-2 (July), 299-337.
28. KORF, R., REID, M., AND EDELKAMP, S. 2001. Time complexity of Iterative-Deepening-A*. Artif. Intell. 129, 1-2 (June), 199-218.
29. KORF, R., AND ZHANG, W. 2000. Divide-and-conquer frontier search applied to optimal sequence alignment. In Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-00) (Austin, TX). 910-916.
30. LERMEN, M., AND REINERT, K. 2000. The practical use of the A* algorithm for exact multiple sequence alignment. J. Computat. Biol. 7, 5, 655-671.
31. NEEDLEMAN, S., AND WUNSCH, C. 1970. A general method applicable to the search for similarities in the amino acid sequences of two proteins. J. Molec. Biol. 48, 443-453.
32. PEARL, J. 1984. Heuristics. Addison-Wesley, Reading, MA.
33. POHL, I. 1970. Heuristic search viewed as path finding in a graph. Artif. Intell. 1, 193-204.
34. POHL, I. 1971. Bi-directional search. In Machine Intelligence 6, B. Meltzer and D. Michie, Eds. American Elsevier, New York, 127-140.
35. REINEFELD, A. 1993. Complete solution of the Eight Puzzle and the benefit of node ordering in IDA*. In Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-93) (Chambery, France). 248-253.
36. RUDIN, H. 1987. Network protocols and tools to help produce them. In Annual Review of Computer Science, J. Traub, B. Grosz, B. Lampson, and N. Nilsson, Eds. Annual Reviews Inc., Palo Alto, CA, 291-316.
37. RUSSELL, S. 1992. Efficient memory-bounded search methods. In Proceedings of the 10th European Conference on Artificial Intelligence (ECAI-92) (Vienna, Austria). 1-5.
38. SCHOFIELD, P. 1967. Complete solution of the Eight Puzzle. In Machine Intelligence 3, B. Meltzer and D. Michie, Eds. American Elsevier, New York, 125-133.
39. SEN, A., AND BAGCHI, A. 1989. Fast recursive formulations for best-first search that allow controlled use of memory. In Proceedings of the 11th International Joint Conference on Artificial Intelligence (IJCAI-89) (Detroit, MI). 297-302.
40. SETUBAL, J., AND MEIDANIS, J. 1997. Introduction to Computational Molecular Biology. PWS Publishing, Boston, MA.
41. SPOUGE, J. 1989. Speeding up dynamic programming algorithms for finding optimal lattice paths. SIAM J. Appl. Math. 49, 5, 1552-1566.
42. STEWART, B. 1941. Solution to advanced problem 3918. Amer. Math. Monthly 48, 217-219.
43. TAYLOR, L., AND KORF, R. 1993. Pruning duplicate nodes in depth-first search. In Proceedings of the 11th National Conference on Artificial Intelligence (AAAI-93) (Washington, DC). 756-761.
44. THAYER, I. 2003. Methods for optimal multiple sequence alignment. M.S. dissertation. Computer Science Department, University of California, Los Angeles, CA.
45. THOMSON, J., PLEWNIAK, F., AND POCH, O. 1999. BAliBASE: A benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics 15, 1, 87-88.
46. UKKONEN, E. 1985. Algorithms for approximate string matching. Info. Contr. 64, 100-118.
47. YOSHIZUMI, T., MIURA, T., AND ISHIDA, T. 2000. A* with partial expansion for large branching factor problems. In Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-00) (Austin, TX). 923-929.
48. ZHOU, R., AND HANSEN, E. 2002. Multiple sequence alignment using anytime A*. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-02) (Edmonton, Alberta, Canada). 975-976.
49. ZHOU, R., AND HANSEN, E. 2003a. Sparse-memory graph search. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03) (Acapulco, Mexico). 1259-1266.
50. ZHOU, R., AND HANSEN, E. 2003b. Sweep-A*: Space-efficient heuristic search in partially ordered graphs. In Proceedings of the 15th International Conference on Tools with Artificial Intelligence (ICTAI-03) (Sacramento, CA). 427-434.
51. ZHOU, R., AND HANSEN, E. 2004. Breadth-first heuristic search. In Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS-04) (Whistler, British Columbia, Canada). 92-100.