Shift Or algorithm

uses bitwise techniques; efficient if the pattern length is no longer than the memory-word size of the machine; preprocessing phase in O(m + ) time and space complexity; searching phase in O(n) time complexity (independent from the alphabet size and the pattern length); adapts easily to approximate string matching. The Shift Or algorithm uses bitwise techniques. Let R be a bit array of size m. Vec

[kzfm]

Shift-OR