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

Szymon Grabowski Kimmo Fredriksson

Published in: Inf. Process. Lett. (2008)

Keyphrases

hamming distance
pattern matching
string matching
bit parallel
worst case
regular expressions
binary strings
lower bound
approximate string matching
binary codes
suffix tree
computer vision
graph matching
multi dimensional
high dimensional
suffix array
keywords
database systems
databases