Spouge J L
J Mol Biol. 1985 Jan 5;181(1):137-8. doi: 10.1016/0022-2836(85)90331-6.
Recent algorithms (e.g. Ukkonen, Fickett) align nucleic acid sequences (starting from the left) by bounding the allowed distance between subsequences by d, aligning, then incrementing d until all of both sequences are aligned. Aligning from both ends is more efficient. If the single-ended algorithm has computational cost CNk (C, k = constants; N = sequence length), the double-ended algorithm often has cost C(N/2)k.
最近的算法（如乌科宁算法、菲克特算法）通过将子序列之间允许的距离限制为d，从左侧开始对核酸序列进行比对，然后增加d，直到两个序列全部比对完成。从两端同时进行比对效率更高。如果单端算法的计算成本为CNk（C、k为常数；N为序列长度），那么双端算法的成本通常为C(N/2)k。
