Sweep A*: Space-Efficient Heuristic Search in Partially Ordered Graphs

Authors:
Rong Zhou;Eric A. Hansen
Affiliations:
-;-
Venue:
ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
Year:
2003

Citing 0
Cited 14

Frontier search

Journal of the ACM (JACM)
Breadth-first heuristic search

Artificial Intelligence
Anytime search in dynamic graphs

Artificial Intelligence
Externalizing the Multiple Sequence Alignment Problem with Affine Gap Costs

KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
Weighted A∗ search -- unifying view and application

Artificial Intelligence
Structured duplicate detection in external-memory graph search

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A breadth-first approach to memory-efficient graph search

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
External-memory pattern databases using structured duplicate detection

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Best-first search for treewidth

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
An improved search algorithm for optimal multiple-sequence alignment

Journal of Artificial Intelligence Research
Multiple-goal heuristic search

Journal of Artificial Intelligence Research
Breadth-first heuristic search

Artificial Intelligence
Combining breadth-first and depth-first strategies in searching for treewidth

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Light-assisted A* path planning

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a novel heuristic search algorithm, called Sweep A*, that exploits the regular structure of partially ordered graphs to substantially reduce the memory requirements of search. We show that it outperforms previous search algorithms in optimally aligning multiple protein or DNA sequences, an important problem in bioinformatics. Sweep A* also promises to be effective for other search problems with similar structure.