loading...
Sweep A*: Space-Efficient Heuristic Search in Partially Ordered Graphs
Sacramento, California, USA November 03-November 05
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TAI.2003.125022115th IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Rong Zhou, Mississippi State University
Eric A. Hansen, Mississippi State University
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.