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

Given two strings, a pattern P of length m and a text T of length n over some alphabet , we consider the string matching problem under k mismatches. The well

• Type: Journal
• Year: 2008
• Where: IPL
• Authors: Szymon Grabowski, Kimmo Fredriksson
• Keywords: Algorithms, IPL 2008, String Matching, String Matching Problem