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

SIAM Journal on Computing

Volumn 27, Issue 3, 1998, Pages 668-681

  Crochemore, Maxime ^a   Gasieniec, Leszek ^b   Hariharan, Ramesh ^c   Muthukrishnan, S ^a,d   Rytter, Wojciech ^b  

^a Université de Marne la Vallée   (France)

^b UNIVERSITY OF WARSAW   (Poland)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^d LUCENT TECHNOLOGIES   (United States)

Author keywords

Duelling; Pattern matching; Periodicity; PRAM; Two dimensional; Witnesses

Indexed keywords

EID: 0346984925     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795280068     Document Type: Article

References (27)

1. [AB92] A. AMIR AND G. BENSON, Two dimensional periodicity in rectangular arrays, in Proceedings of the 3rd Annual ACM Symposium on Discrete Algorithms, ACM, New York, 1992, pp. 440-452.
2. [ABF92] A. AMIR, G. BENSON, AND M. FARACH, Alphabet independent two dimensional matching, in Proceedings of the 24th Annual ACM Symposium on Theory of Computing, ACM, New York, 1992, pp. 59-68.
3. [ABF93] A. AMIR, G. BENSON, AND M. FARACH, Parallel two dimensional matching in logarithmic time, in Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, ACM, New York, 1993, pp. 79-85.
4. [ABG92] A. APOSTOLICO, D. BRESLAUER, and Z. GALIL, Optimal parallel algorithms for periods, palindromes and squares, in Proceedings of the 19th International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 623, Springer-Verlag, Berlin, 1992, pp. 296-307.
5. [AL88] A. AMIR AND G. LANDAU, Fast parallel and serial multidimensional approximate array matching, Theoret. Comput. Sci., 81 (1988), pp. 347-365.
6. [Ba78] T. J. BAKER, A technique for extending rapid exact-match string matching to arrays of more than one dimension, SIAM J. Comput. 7 (1978), pp. 533-541.
7. [Bi77] R. S. BIRD, Two dimensional pattern matching, Inform. Process. Lett., 6 (1977), pp. 168-170.
8. [BG90] D. BRESLAUER AND Z. GALIL, An optimal O(log log m) time parallel string matching algorithm, SIAM J. Comput., 19 (1990), pp. 1051-1058.
9. [CC+93] R. COLE, M. CROCHEMORE, Z. GALIL, L. GASIENIEC, R. HARIHARAN, S. MUTHUKRISHNAN, K. PARK, AND W. RYTTER, Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions, in Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 248-258.
10. [CG+93a] M. CROCHEMORE, L. GASIENIEC, Z. GALIL, K. PARK, AND W. RYTTER, Constant Time Deterministic Sample Computation and Its Applications, manuscript, 1993.
11. [CG+93b] R. COLE, Z. GALIL, R. HARIHARAN, S. MUTHUKRISHNAN, AND K. PARK, Optimal Parallel Two Dimensional Witness Computation, manuscript, 1993.
12. [CR91] M. CROCHEMORE AND W. RYTTER, Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations in strings and arrays, Theoret. Comput. Sci., 88 (1991), pp. 59-62.
13. [CR95] M. CROCHEMORE AND W. RYTTER, On linear-time alphabet-independent 2-dimensional pattern matching, LATIN'95, Lecture Notes in Comput. Sci. 911, Springer-Verlag, Berlin, 1995, pp. 220-229.
14. [FRW88] F. FICH, R. RAGDE, AND A. WIDGERSON, Relations between concurrent-write models of parallel computation, SIAM J. Comput., 17 (1988), pp. 606-627.
15. [Ga85] Z. GALIL, Optimal parallel algorithms for string matching, Inform, and Control, 67 (1985), pp. 144-157.
16. [Ga92] Z. GALIL, Hunting lions in the desert optimally or a constant-time optimal parallel string matching algorithm, in Proceedings of the 24th Annual ACM Symposium on Theory of Computing, ACM, New York, 1992, pp, 69-76.
17. [GP92] Z. GALIL AND K. PARK, Truly alphabet-independent two dimensional matching, in Proceedings of the 33rd Annual IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 247-256.
18. [Ja91] J. JAJA, Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1991.
19. [KLP89] Z. KEDEM, G. LANDAU, AND K. PALEM, Optimal parallel suffix-prefix matching algorithm and application, in Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, ACM, New York, 1989, pp. 388-398.
20. [KMR72] R. M. KARP, R. E. MILLER, AND A. L. ROSENBERG, Rapid identification of repeated patterns in strings, trees and arrays, in Proceedings of the 4th Annual ACM Symposium on Theory of Computing, ACM, New York, 1972, pp. 125-136.
21. [KR87] R. KARP AND M. RABIN, Efficient randomized pattern matching algorithms, IBM J. Res. Develop., 31 (1987), pp. 249-260.
22. P in a free group, Michigan Math. J., 9 (1962), pp. 289-298.
23. [M88] T. MATHIES, A Fast Parallel Algorithm to Determine Edit Distance, Technical Report TR CMU-CS-88-130, Carnegie-Mellon Univ., Pittsburgh, PA, 1988.
24. [Ra90] P. RAGDE, The parallel simplicity of compaction and chaining, in Proceedings of the 17th International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 443, Springer-Verlag, Berlin, 1990, pp. 744-751.
25. [RS62] J. B. ROSSER AND L. SCHOENFELD, Approximate formulas for some functions of prime numbers, Illinois J. Math., 6 (1962), pp. 64-94.
26. [Vi85] U. VISHKIN, Optimal pattern matching in strings, Inform, and Control, 67 (1985), pp. 91-113.
27. [Vi90] U. VISHKIN, Deterministic sampling - A new technique for fast pattern matching, in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, ACM, New York, 1990, pp. 170-180.