Skip to main content
Article thumbnail
Location of Repository

Experiments with Algorithms for DNA Sequence Alignment

By Matt Lehman

Abstract

A DNA sequence is a representation of the genetic code contained within an organism. Molecular biology researchers have great need to compare portions of DNA sequences. This paper discusses the computational problems inherent to this application, and shows how some solutions may be implemented. Global and local alignment implementations are presented. Known methods of quantifying global and local alignments are discussed and demonstrated. Dynamic programming techniques (using memoization through tabular computation) are discussed and applied to the implementations. As a background primer to these techniques, the concepts of ‘string edit distance ’ and ‘string edit transcripts ’ are discussed, and implementations to demonstrate them are presented. Background information is provided on the basics of DNA, the composition of DNA sequences, the motivations for DNA sequence alignment, and computational problems related to DNA sequence alignment

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.8387
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.micsymposium.org/mi... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.