Methods for comparing a DNA sequence with a protein sequence.
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.
Huang
X
X
Department of Computer Science, Michigan Technological University, Houghton 49931, USA. huang@cs.mtu.edu
Zhang
J
J
D000465:Algorithms; D000595:Amino Acid Sequence; D000818:Animals; D001483:Base Sequence; D004247:DNA / Q000235:genetics*; D005069:Evaluation Studies as Topic; D006801:Humans; D008969:Molecular Sequence Data; D011506:Proteins / Q000235:genetics*; D012680:Sensitivity and Specificity; D016415:Sequence Alignment / Q000379:methods* / Q000706:statistics & numerical data; D012984:Software
D011506:Proteins; D004247:DNA