Evaluations of hash distributed A* in optimal sequence alignment

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 584-590

  Kobayashi, Yoshikazu ^a   Kishimoto, Akihiro ^a   Watanabe, Osamu ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CPU CORES; EDGE COSTS; MULTI-CORE MACHINES; OPTIMAL SEQUENCE; OPTIMAL SEQUENTIAL; PARALLEL A; SEARCH EFFORTS; WORK DISTRIBUTION;

ALIGNMENT; ARTIFICIAL INTELLIGENCE; OPTIMIZATION;

DIRECTIVE ANTENNAS;

EID: 84868282660     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-105     Document Type: Conference Paper

References (18)

1. E. Burns, S. Lemons, W. Ruml, and R. Zhou. Best-first heuristic search for multicore machines. Journal of Artificial Intelligence Research, 39:689-743, 2010.
2. S. Dutt and N. Mahapatra. Scalable load balancing strategies for parallel A* algorithms. Journal of Parallel and Distributed Computing, 22:488-505, 1994.
3. M. Evett, J. Hendler, A. Mahanti, and D. Nau. PRA*: Massively parallel heuristic search. Journal of Parallel and Distributed Computing, 25(2):133-143, 1995.
4. P. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2):100-107, 1968.
5. T. Ikeda 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, 210(2):341-374, 1999. (Pubitemid 129611358)
6. R. Karp and Y. Zhang. A randomized parallel branch-and-bound procedure. In Proceedings of the 20th ACM Symposium on Theory of Computing (STOC), pages 290-300, 1988.
7. A. Kishimoto, A. Fukunaga, and A. Botea. Scalable, parallel best-first search for optimal sequential planning. In Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS-2009), pages 201-208, 2009.
8. A. Kishimoto, A. Fukunaga, and A. Botea. On the scaling behavior of HDA*. In Proceedings of the 3rd Symposium on Combinatorial Search (SoCS'2010), pages 61-62. AAAI Press, 2010.
9. R. E. Korf, W. Zhang, I. Thayer, and H. Hohwald. Frontier search. Journal of the ACM, 52(5):715-748, 2005. (Pubitemid 41527577)
10. R. Korf. Depth-first iterative deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97-109, 1985. (Pubitemid 15604803)
11. R. E. Korf. Delayed duplicate detection: extended abstract. In Proceedings of IJCAI-03, pages 1539-1541, 2003.
12. N. Mahapatra and S. Dutt. Scalable global and local hashing strategies for duplicate pruning in parallel A* graph search. IEEE Transactions on Parallel and Distributed Systems, 8(7):738-756, 1997. (Pubitemid 127776425)
13. R. Niewiadomski, J. N. Amaral, and R. C. Holte. Sequential and parallel algorithms for frontier A* with delayed duplicate detection. In Proceedings of AAAI-06, pages 1039-1044, 2006.
14. J. W. Romein, H. E. Bal, J. Schaeffer, and A. Plaat. A performance analysis of transposition-table-driven work scheduling in distributed search. IEEE Transactions on Parallel and Distributed Systems, 13(5):447-459, 2002. (Pubitemid 34669579)
15. J. D. Thompson, P. Koehl, R. Ripp, and O. Poch. BAliBASE 3.0: Latest developments of the multiple sequence alignment benchmark. Proteins: Structure, Function, and Bioinformatics, 61:127-136, 2005. (Pubitemid 41263414)
16. R. Zhou and E. Hansen. Sparse-memory graph search. In Proceedings of IJCAI' 2003, pages 1259-1266, 2003.
17. R. Zhou and E. Hansen. Domainin-dependent structured duplicate detection. In Proceedings of AAAI-06, pages 1082-1087, 2006.
18. A.L. Zobrist. A new hashing method with application for game playing. Technical Report 88, University of Wisconsin, 1970.