Taylor P
Nucleic Acids Res. 1984 Jan 11;12(1 Pt 2):447-55. doi: 10.1093/nar/12.1part2.447.
The algorithm of Gotoh computes in two passes of MN steps the alignment of a pair of sequences of lengths M and N, subject to a constraint on the form of the gap weighting function. This compares with the previous algorithm of Waterman et al. which runs in M2N steps. Gotoh also gave a method using two passes of (L+2)MN steps in the case where gap weights remain constant for gaps of length greater than L. Here we describe a procedure for computing the alignment (evolutionary distance and optimal path) in a single pass of MN steps for both cases.
Gotoh算法通过MN步的两次遍历计算长度分别为M和N的一对序列的比对,前提是间隙加权函数的形式受到约束。这与Waterman等人之前的算法形成对比,后者的运行步数为M²N步。在间隙权重对于长度大于L的间隙保持恒定的情况下,Gotoh还给出了一种使用(L + 2)MN步两次遍历的方法。在这里,我们描述了一种在两种情况下通过MN步单次遍历计算比对(进化距离和最优路径)的过程。