抄録
The multiple alignment of the sequences of DNA and proteins is applicable to various important fields in molecular biology. Although the approach based on Dynamic Pro-gramming is well-known for this problem, it requires enormous time and space to obtain the optimal alignment. On the other hand, this problem correspondsto the shortest path problem and the A algorithm, which can efficiently find theshortest path with an estimator, is usable.
This paper directly applies the Aalgorithm to multiple sequence alignment problem with more powerful estimator inmore than two dimensional case and discusses the im-provement of this approach utilizing an upper bound of the shortest path length. The algorithm to provide the upper bound is also proposed in this paper.
