With PQDT Open, you can read the full text of open access dissertations and theses free of charge.
About PQDT Open
Search
Dissertation/Thesis Abstract
-
Other Available Formats:
-
Full Text - PDF
(4.61 MB)
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.
| Advisor: | Chang, Jen-Mei |
| Commitee: | |
| School: | California State University, Long Beach |
| School Location: | United States -- California |
| Source: | MAI 49/02M, Masters Abstracts International |
| Source Type: | DISSERTATION |
| Subjects: | Applied Mathematics, Bioinformatics |
| Keywords: | |
| Publication Number: | 1486717 |
| ISBN: | 978-1-124-27710-3 |
