Multiple sequence alignment using anytime A*

Authors:
Rong Zhou;Eric A. Hansen
Affiliations:
Computer Science Department, Mississippi State University, Mississippi State, MS;Computer Science Department, Mississippi State University, Mississippi State, MS
Venue:
Eighteenth national conference on Artificial intelligence
Year:
2002

Citing 3
Cited 14

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Enhanced A algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases

Theoretical Computer Science - Special issue: Genome informatics
A* with Partial Expansion for Large Branching Factor Problems

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence

Frontier search

Journal of the ACM (JACM)
Anytime search in dynamic graphs

Artificial Intelligence
Weighted A∗ search -- unifying view and application

Artificial Intelligence
Planning Long Dynamically Feasible Maneuvers for Autonomous Vehicles

International Journal of Robotics Research
R* search

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Multiple-goal heuristic search

Journal of Artificial Intelligence Research
Anytime heuristic search

Journal of Artificial Intelligence Research
AWA*-a window constrained anytime heuristic search algorithm

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Best-first utility-guided search

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A bug-inspired algorithm for efficient anytime path planning

IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
A coarse-to-fine approach for fast path finding for mobile robots

IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
A framework for quasi-exact optimization using relaxed best-first search

KI'06 Proceedings of the 29th annual German conference on Artificial intelligence
A survey and classification of A* based best-first heuristic search algorithms

SBIA'10 Proceedings of the 20th Brazilian conference on Advances in artificial intelligence
ARA*+: Improved Path Planning Algorithm Based on ARA*

WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02

Quantified Score

Hi-index	0.00

Multiple sequence alignment using anytime A*

Quantified Score

Visualization

Abstract