Huang X, Zhang J
Department of Computer Science, Michigan Technological University, Houghton 49931, USA.
Comput Appl Biosci. 1996 Dec;12(6):497-506. doi: 10.1093/bioinformatics/12.6.497.
We describe two methods for constructing an optimal global alignment of, and an optimal local alignment between, a DNA sequence and a protein sequence. The alignment model of the methods addresses the problems of frameshifts and introns in the DNA sequence. The methods require computer memory proportional to the sequence lengths, so they can rigorously process very huge sequences. The simplified versions of the methods were implemented as computer programs named NAP and LAP. The experimental results demonstrate that the programs are sensitive and powerful tools for finding genes by DNA-protein sequence homology.
我们描述了两种用于构建DNA序列与蛋白质序列之间的最优全局比对以及最优局部比对的方法。这些方法的比对模型解决了DNA序列中的移码和内含子问题。这些方法所需的计算机内存与序列长度成正比,因此它们能够严格处理非常长的序列。这些方法的简化版本被实现为名为NAP和LAP的计算机程序。实验结果表明,这些程序是通过DNA-蛋白质序列同源性来寻找基因的灵敏且强大的工具。