Faster two-dimensional pattern matching with $k$ mismatches

Jonas Ellert, Paweł Gawrychowski, Adam Górkiewicz +1

The classical pattern matching asks for locating all occurrences of one string, called the pattern, in another, called the text, where a string is simply a sequence of characters.…