An efficient algorithm to locate all locally optimal alignments between two sequences allowing for gaps
Laboratory of Molecular Biophysics, University of Oxford Rex Richards Building, South Parkt Road, Oxford OXI 3QU, UK
An efficient algorithm is described to locate locally optimal alignments between two sequences allowing for insertions and deletions. The algorithm is based on that of Smith and Waterman which returns the single best local alignment. However, the algorithm described here permits all non-intersecting locally optimal alignments to be determined in a single pass through the comparison matrit The algorithm simplifies the location of repeats, multiple domains and shuffled moz and is fast enough to be used on a conventional workstation to scan large sequence databanks.
Received on April 30, 1993; accepted on June 29, 1993
This article has been cited by other articles:
![]() |
W. Huang, D. M. Umbach, and L. Li Accurate anchoring alignment of divergent sequences Bioinformatics, January 1, 2006; 22(1): 29 - 34. [Abstract] [Full Text] [PDF] |
||||
![]() |
A. Zhang, B. Potvin, A. Zaiman, W. Chen, R. Kumar, L. Phillips, and P. Stanley The Gain-of-Function Chinese Hamster Ovary Mutant LEC11B Expresses One of Two Chinese Hamster FUT6 Genes Due to the Loss of a Negative Regulatory Factor J. Biol. Chem., April 9, 1999; 274(15): 10439 - 10450. [Abstract] [Full Text] [PDF] |
||||

