Alphabet independent approach to two-dimensional pattern matching

The authors show an algorithm for two-dimensional matching with an O(n²log m ) text-scanning phase. Furthermore, the text scan requires no special assumptions about the alphabet, i.e. it runs on the same model as the standard linear-time string-matching algorithm. The pattern preprocessing requires an ordered alphabet and runs with the same alphabet dependency as the previously known algorithms.