COMING SOON! PQDT Open is getting a new home!

ProQuest Open Access Dissertations & Theses will remain freely available as part of a new and enhanced search experience at

Questions? Please refer to this FAQ.

Dissertation/Thesis Abstract

Efficiency of pair-wise and multiple alignment algorithms in computational biology
by Vu, Man H., M.S., California State University, Long Beach, 2010, 67; 1486717
Abstract (Summary)

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.

Indexing (document details)
Advisor: Chang, Jen-Mei
School: California State University, Long Beach
School Location: United States -- California
Source: MAI 49/02M, Masters Abstracts International
Subjects: Applied Mathematics, Bioinformatics
Publication Number: 1486717
ISBN: 978-1-124-27710-3
Copyright © 2021 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy