Mironov A A, Aleksandrov N N
Biofizika. 1988 Mar-Apr;33(2):229-32.
A new method of the homology search between DNA sequences was suggested. This method may be used to find extensive and not strong homologies with point mutations and deletions. The computer time to compare sequences is less than dynamic program algorithms at least by four orders of magnitude. It makes possible to use the method for homology search all over the nucleotide bank by personal computers. Some results of homology search are presented.
提出了一种新的DNA序列同源性搜索方法。该方法可用于寻找存在点突变和缺失的广泛且不太强的同源性。序列比较的计算机时间比动态规划算法至少少四个数量级。这使得个人计算机能够使用该方法在整个核苷酸库中进行同源性搜索。文中给出了一些同源性搜索的结果。
