15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'03) Sweep A*: Space-Efficient Heuristic Search in Partially Ordered Graphs Sacramento, California, USA November 03-November 05 ISBN: 0-7695-2038-3
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.
Citation:
Rong Zhou, Eric A. Hansen, "Sweep A*: Space-Efficient Heuristic Search in Partially Ordered Graphs," ictai, pp.427, 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'03), 2003 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||