Methods for comparing a dna sequence with a protein sequence
Document Type
Article
Publication Date
1-1-1996
Abstract
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. © 1996, Oxford University Press.
Publication Title
Bioinformatics
Recommended Citation
Huang, X.,
&
Zhang, J.
(1996).
Methods for comparing a dna sequence with a protein sequence.
Bioinformatics,
12(6), 497-506.
http://doi.org/10.1093/bioinformatics/12.6.497
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/9772