|
|
|
|
|
by keithwhor
4131 days ago
|
|
The algorithm maps every position of seqSearch to seqGenome, aggregates the results, and returns them. It is not merely a string search. (If it were, the Booyer-Moore [1] algorithm would outperform this significantly, binary or not, and we'd call it a day.) It is aligning seqSearch to seqGenome and returning the best results, in order. Alignment is not restricted to "gapped" alignments only (or there wouldn't be a need for such a distinction!). You can modify the algorithm to include gapped alignments (by introducing gaps in your search sequence), as it supports a "gap" character ("-"). The gap character will just always count as "not a match." [1] http://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_sear... |
|
I am not sure you understand what gapped alignment is- it is not the alignment of a sequence with known gaps, but an algorithm which determines the best placement of gaps in a query sequence to obtain the highest matching score. This is a very different problem than the one you just described, and is essentially "the hard part" of sequence alignment. [1] http://en.m.wikipedia.org/wiki/Sequence_alignment