A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching

We give an alphabet-independent deterministic parallel algorithm for finding all occurrences of a pattern array of size mh x mw in a text array of size nh x nw in the concurrent-read-concurrent-write--parallel-random-access-machine (CRCW--PRAM) model. Our algorithm runs in O(1) time performing optimal, that is, O(nh x nw) work, following preprocessing of the pattern. This improves the previous best bound of O(log log m ) time with optimal work [A. Amir, G. Benson, and M. Farach, Proceedings 5th Annual ACM Symposium on Parallel Algorithms and Architectures, ACM, New York, 1993, pp. 79--85], following preprocessing of the pattern, where m=max{mh, mw}. The preprocessing required by our algorithm (and that due to Amir, Benson, and Farach) can be accomplished in O(log log m) time and O(mh x mw) work [M. Crochemore et al., manuscript, 1993], [R. Cole et al., manuscript, 1993].

[1]  Zvi Galil,et al.  Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract) , 1992, ICALP.

[2]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[3]  Richard M. Karp,et al.  Efficient Randomized Pattern-Matching Algorithms , 1987, IBM J. Res. Dev..

[4]  M. Schützenberger,et al.  The equation $a^M=b^Nc^P$ in a free group. , 1962 .

[5]  Theodore P. Baker.  A Technique for Extending Rapid Exact-Match String Matching to Arrays of More Than One Dimension , 1978, SIAM J. Comput..

[6]  R.S. Bird,et al.  Two Dimensional Pattern Matching , 1977, Inf. Process. Lett..

[7]  Arnold L. Rosenberg,et al.  Rapid identification of repeated patterns in strings, trees and arrays , 1972, STOC.

[8]  T. Mathies.  A fast parallel algorithm to determine edit distance , 1988 .

[9]  P. Ragde.  The parallel simplicity of compaction and chaining , 1990 .

[10]  Faith Ellen,et al.  Relations Between Concurrent-Write Models of Parallel Computation , 1988, SIAM J. Comput..

[11]  Uzi Vishkin,et al.  Optimal Parallel Pattern Matching in Strings , 2017, Inf. Control..

[12]  Gary Benson,et al.  Alphabet independent two dimensional matching , 1992, STOC '92.

[13]  Gary Benson,et al.  Optimal parallel two dimensional pattern matching , 1993, SPAA '93.

[14]  Wojciech Rytter,et al.  Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[15]  Wojciech Rytter,et al.  On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching , 1995, LATIN.

[16]  J. Rosser,et al.  Approximate formulas for some functions of prime numbers , 1962 .

[17]  Gary Benson,et al.  Two-Dimensional Periodicity in Rectangular Arrays , 1998, SIAM J. Comput..

[18]  Zvi Galil.  Optimal Parallel Algorithms for String Matching , 1985, Inf. Control..

[19]  Gad M. Landau,et al.  Fast Parallel and Serial Multidimensional Aproximate Array Matching , 1991, Theor. Comput. Sci..

[20]  Uzi Vishkin,et al.  Deterministic sampling—a new technique for fast pattern matching , 1990, STOC '90.