White C T, Hardies S C, Hutchison C A, Edgell M H
Nucleic Acids Res. 1984 Jan 11;12(1 Pt 2):751-66. doi: 10.1093/nar/12.1part2.751.
We present a fast computer algorithm for finding homology between two DNA sequences. It generates a two-dimensional display in which a diagonal string of dots represents a stretch of homology between the two sequences. Our algorithm performs the search very rapidly, and has no internal data storage requirement except for the sequences themselves. These characteristics make it particularly well suited for execution on microcomputers. Without slowing execution, the matching criterion can be that a specified fraction of contiguous bases must be identical. Even with gapped sequences, we have found large search windows to be surprisingly good for detecting poor homologies with nearly complete background suppression. A diagonal search pattern is used that reports the finds in a compact and logically ordered form. A simple and rapid plotting algorithm for unsophisticated printers is also reported.
我们提出了一种用于寻找两个DNA序列之间同源性的快速计算机算法。它生成一个二维显示,其中对角线上的一串点表示两个序列之间的一段同源性。我们的算法执行搜索速度非常快,除了序列本身外没有内部数据存储要求。这些特性使其特别适合在微型计算机上执行。在不降低执行速度的情况下,匹配标准可以是指定比例的相邻碱基必须相同。即使对于有缺口的序列,我们发现大的搜索窗口对于检测同源性较差且几乎完全抑制背景的情况也出奇地有效。使用对角搜索模式以紧凑且逻辑有序的形式报告发现结果。还报告了一种适用于简单打印机的简单快速绘图算法。