 
Summary: Faster Algorithms for String Matching with k Mismatches
Amihood Amir \Lambday Moshe Lewenstein \Lambda z Ely Porat \Lambda
BarIlan University and BarIlan University Bar Ilan University and
Georgia Tech Weizmann Institute
Abstract
The string matching with mismatches problem is that
of finding the number of mismatches between pattern
P of length m and every length m substring of the
text T . Currently, the best algorithms for this problem
are the following. The LandauVishkin algorithm finds
all locations where the pattern has at most k errors
(where k is part of the input) in time O(nk). The
Abrahamson algorithm finds the number of mismatches
at every location in time O(n
p
m log m).
We present an algorithm that is faster than both.
Our algorithm finds all locations where the pattern has
at most k errors in time O(n
p
