Home → Magazine Archive → September 1989 (Vol. 32, No. 9) → A technique for two-dimensional pattern matching → Abstract

A technique for two-dimensional pattern matching

By Rui Feng Zhu, Tadao Takaoka

Communications of the ACM, Vol. 32 No. 9, Pages 1110-1120

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.

The full text of this article is premium content


No entries found