A* Algorithms for the Constrained Multiple Sequence Alignment Problem


It is well known that A algorithm reduces the search space in many applications. For shortest path computations, the algorithm uses a heuristic estimator which can better guide the search to the destination. It allocates memory dynamically to store only the necessary vertices, which are those vertices in its open list and close list. Therefore, an A… (More)

5 Figures and Tables


  • Presentations referencing similar topics