Mironov A A, Alexandrov N N
Institute for Genetics of Microorganisms, Moscow, USSR.
Nucleic Acids Res. 1988 Jun 10;16(11):5169-73. doi: 10.1093/nar/16.11.5169.
A new method for homology search of DNA sequences is suggested. This method may be used to find extensive and not strong homologies with point mutations and deletions. The running program time for comparing sequences is less then the dynamic program algorithms at least at two orders of magnitude. It makes possible to use the method for homology searching throughover the nucleotide bank by personal computers.
提出了一种DNA序列同源性搜索的新方法。该方法可用于寻找存在点突变和缺失的广泛且不太强的同源性。比较序列的运行程序时间比动态规划算法至少少两个数量级。这使得使用该方法通过个人计算机在整个核苷酸库中进行同源性搜索成为可能。