Boswell D R, McLachlan A D
Nucleic Acids Res. 1984 Jan 11;12(1 Pt 2):457-64. doi: 10.1093/nar/12.1part2.457.
We describe a new method of comparing sequences, based on the Needleman-Wunsch sequence alignment algorithm, which can detect similarities that are interrupted by insertions or deletions in either sequence. The sequences are compared by calculating for each pair of residues a score which represents the best local alignment bringing those residues into correspondence; smooth localisation is achieved by reducing the contribution of distant parts of the alignment path by a factor which decreases exponentially with their distance from the point in question. The calculated values are used to draw a line graph in which regions of local similarity are shown by diagonal lines. Examples are shown of the application of the method to nucleic acid and amino acid sequences.
我们描述了一种基于Needleman-Wunsch序列比对算法的新的序列比较方法，该方法能够检测出因任一序列中的插入或缺失而中断的相似性。通过为每对残基计算一个分数来比较序列，该分数代表使这些残基对应起来的最佳局部比对；通过将比对路径中较远部分的贡献按一个随其与所讨论点的距离呈指数下降的因子进行缩减，实现平滑定位。计算得到的值用于绘制折线图，其中局部相似性区域由对角线表示。展示了该方法应用于核酸和氨基酸序列的示例。
