 
Summary: An Alphabet Independent Approach to Two Dimensional Matching \Lambda
Amihood Amir y Gary Benson z Martin Farach x
Georgia Tech Univ. of Maryland DIMACS
Abstract
There are many solutions to the string matching problem which are strictly linear in the
input size and independent of alphabet size. Furthermore, the model of computation for these
algorithms is very weak: they allow only simple arithmetic and comparisons of equality be
tween characters of the input. In contrast, algorithm for two dimensional matching have needed
stronger models of computation, most notably assuming a totally ordered alphabet. The fastest
algorithms for two dimensional matching have therefore had a logarithmic dependence on the al
phabet size. In the worst case, this gives an algorithm that runs in O(n 2 log m) with O(m 2 log m)
preprocessing.
We show an algorithm for two dimensional matching with an O(n 2 ) 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.
Key Words: multidimensional matching, period, string
AMS(MOS) subject classifications: 68Q05, 68Q20, 68Q25
Abreviated title: Two Dimensional Matching
