Skip to main content
Fig. 5 | BMC Bioinformatics

Fig. 5

From: Accelerating the Smith-Waterman algorithm with interpair pruning and band optimization for the all-pairs comparison of base sequences

Fig. 5

Matching and unmatching patterns for three sequences. Three operations can occur at every position on a sequence: a match, a replacement, and a gap insertion. Considering these operations, eight patterns can occur when considering sequences s a , s b , and s c . A lower bound on the alignment score for pair r=〈a,c〉 can be obtained by counting the number of matching symbols that commonly appear in each of the three sequences

Back to article page

BMC Bioinformatics

ISSN: 1471-2105

Contact us