DNA sequence alignment algorithms have revolutionized the way scientists study classification of species as well as genetic mutation and diseases. Due to the lengthy nature of genome sequences, which can be 2-3 billion base pairs, it is unrealistic to manually compare two such sequences. In this paper, we present various existing state-of-the-art alignment algorithms that have been applied to this problem, in particular, the N-Tuple, dynamical programming, and dot-matrix methods. The efficiency of each method to the DNA sequence alignment problem will be summarized to provide insights to the next-generation sequence alignment technology.
|School:||California State University, Long Beach|
|School Location:||United States -- California|
|Source:||MAI 49/02M, Masters Abstracts International|
|Subjects:||Applied Mathematics, Bioinformatics|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be