Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time.

Szymon Grabowski Kimmo Fredriksson Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time. 182-187 2008 105 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2007.08.021 db/journals/ipl/ipl105.html#GrabowskiF08