Skip to main content
Article
Methods for Comparing a DNA Sequence with a Protein Sequence
CABIOS
  • Xiaoqiu Huang, Iowa State University
  • Jinghui Zhang, National Institutes of Health
Document Type
Article
Publication Version
Published Version
Publication Date
1-1-1996
DOI
10.1093/bioinformatics/12.6.497
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.
Comments

This article is from CABIOS 12 (1996): 497, doi: 10.1093/bioinformatics/12.6.497. Posted with permission.

Rights
Works produced by employees of the U.S. Government as part of their official duties are not copyrighted within the U.S. The content of this document is not copyrighted.
Language
en
File Format
application/pdf
Citation Information
Xiaoqiu Huang and Jinghui Zhang. "Methods for Comparing a DNA Sequence with a Protein Sequence" CABIOS Vol. 12 Iss. 6 (1996) p. 497 - 506
Available at: http://works.bepress.com/xiaoqiu-huang/10/