Optimal sequence alignment using affine gap costs (Q1085098)

When comparing two biological sequences, it is often desirable for a gap to be assigned a cost not directly proportional to its length. If affine gap costs are employed, in other words if opening a gap costs v and each null in the gap costs u, the algorithm of \textit{O. Gotoh} [J. molec, Biol. 162, 705-708 (1982)] finds the minimum cost of aligning two sequences in order MN steps. Gotoh's algorithm attempts to find only one from among possibly many optimal (minimum-cost) alignments, but does not always succeed. This paper provides an example for which this part of Gotoh's algorithm fails and describes an algorithm that finds all and only the optimal alignments. This modification of Gotoh's algorithm still requires order MN steps. A more precise form of path graph than previously used is needed to represent accurately all optimal alignments for affine gap costs.