A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Approximate Boyer–Moore String Matching
1993
SIAM journal on computing (Print)
The Boyer-Moore idea applied in exact string matching is generalized to approximate string matching. Two versions of the problem are considered. The k mismatches problem is to find all approximate occurrences of a pattern string (length m) in a text string (length n) with at most k mismatches. Our generalized Boyer-Moore algorithm is shown (under a mild independence assumption) to solve the problem in expected time O(kn( 1 m -k + k c )) where c is the size of the alphabet. A related algorithm
doi:10.1137/0222018
fatcat:pbbjsiuqpvf3rdnphzci3kcdq4