On global sequence alignment.
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.
Huang
X
X
Department of Computer Science, Michigan Technological University, Houghton 49931.
D000465:Algorithms; D000595:Amino Acid Sequence; D000818:Animals; D002107:Caenorhabditis; D002645:Chickens; D004023:Dictyostelium; D004330:Drosophila; D005914:Globins / Q000235:genetics; D006801:Humans; D008969:Molecular Sequence Data; D009218:Myosins / Q000235:genetics; D011381:Programming Languages; D011817:Rabbits; D016415:Sequence Alignment; D012984:Software; D013045:Species Specificity
D005914:Globins; D009218:Myosins