On global sequence alignment
Document Type
Article
Publication Date
6-1-1994
Abstract
We present a dynamic programming algorithm for computing a best global alignment of two sequences. The proposed algorithm is robust in identifying any of several global relationships between two sequences. The algorithm delivers a best alignment of two sequences in linear space and quadratic time. We also describe a multiple alignment algorithm based on the pairwise algorithm. Both algorithms have been implemented as portable C programs. Experimental results indicate that for a commonly used set of gap penalties, the new programs produce more satisfactory alignments on sequences of various lengths than some existing pairwise and multiple programs based on the dynamic programming algorithm of Needleman and Wunsch. © 1994 Oxford University Press.
Publication Title
Bioinformatics
Recommended Citation
Huang, X.
(1994).
On global sequence alignment.
Bioinformatics,
10(3), 227-235.
http://doi.org/10.1093/bioinformatics/10.3.227
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/9771