A technique for two-dimensional pattern matching

Rui Zhu, Tadao Takaoka · Communications of the ACM · 1989

By reducing an array matching problem to a string matching problem in a natural way, it is shown that efficient string matching algorithms can be applied to arrays, assuming that a linear preprocessing is made on the text.

Read the paper · More papers on PaperTik