Space-efficient memory-based heuristics

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 677-682

  Zhou, Rong ^a   Hansen, Eric A ^a  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DOMAINS; NODES; SPACE COMPLEXITY; SUBSETS;

COMPUTATIONAL METHODS; FUNCTIONS; PROBLEM SOLVING; SET THEORY; STATE SPACE METHODS; TABLE LOOKUP;

HEURISTIC METHODS;

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

References (16)

1. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artificial Intelligence 129(1):5-33.
2. Carrillo, H., and Lipman, D. 1988. The multiple sequence alignment problem in biology. SIAM J. Appl. Math. 48(5): 1073-1082.
3. Culberson, J., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
4. Edelkamp, S. 2002. Symbolic pattern databases in heuristic, search planning. In Proc. of the 6th International Conference on Artificial Intelligence Planning and Scheduling, 274-283.
5. Gupta, S.; Kececioglu, J.; and Schaffer, A. 1995. Improving the practical space and time efficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignment. Journal of Computational Biology 2(3):459-472.
6. Holte, R.; Perez, M.; Zimmer, R.; and MacDonald, A. 1996. Hierarchical A*: Searching abstraction hierarchies efficiently. In Proc. of the 13th National Conf. on Artificial Intelligence, 530-5.
7. 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. Theoretical Computer Science 210(2):341-374.
8. Klein, D., and Manning, C. 2003. Factored A* search for models over sequences and trees. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, 1246-1251.
9. Kobayashi, H., and Imai, H. 1998. Improvement of the A* algorithm for multiple sequence alignment. In Proceedings of the 9th Workshop on Genome Informatics, 120-130.
10. Korf, R., and Felner, A. 2002. Disjoint pattern database heuristics. Artificial Intelligence 134(1-2):9-22.
11. Korf, R. 1997. Finding optimal solutions to Rubik's cube using pattern databases. In Proceedings of the 14th National Conference on Artificial Intelligence, 700-705.
12. Korf, R. 2000. Recent progress in the design and analysis of admissible heuristic functions. In Proc. of the 17th National Conference on Artificial Intelligence, 1165-1170.
13. Lermen, M., and Reinert, K. 2000. The practical use of the A* algorithm for exact multiple sequence alignment. Journal of Computational Biology 7(5):655-671.
14. McNaughton, M.; Lu, P.; Schaeffer, J.; and Szafron, D. 2002. Memory-efficient A* heuristics for multiple sequence alignment. In Proc. of 18th National Conf. on Artificial Intelligence, 737-43.
15. Thompson, J.; Plewniak, F.; and Poch, O. 1999. BAliBASE: A benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics 15(l):87-88.
16. 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, 923-929.