Three-dimensional periodicity and its application to pattern matching

SIAM Journal on Discrete Mathematics

Volumn 18, Issue 2, 2004, Pages 362-381

  Galil, Zvi ^a   Park, Jong Geun ^b   Park, Kunsoo ^c  

^a Department of Earth and Environmental Sciences   (United States)

^b Chonbuk National University   (South Korea)

^c Seoul National University   (South Korea)

Author keywords

Pattern matching; Three dimensional periodicity

Indexed keywords

FINITE ARRAYS; PERIODICITY ANALYSIS; SUBSTRINGS; THREE-DIMANSIONAL PERIODICITY;

CALCULATIONS; CODES (SYMBOLS); PARALLEL ALGORITHMS; PROBLEM SOLVING; THREE DIMENSIONAL; VECTORS;

PATTERN MATCHING;

EID: 18744393408     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480101390308     Document Type: Article

References (21)

1. [AB] A. AMIR AND G. BENSON, Two-dimensional periodicity and its applications, in Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms, Orlando, FL, 1992, pp. 440-452.
2. [ABF] A. AMIR, G. BENSON, AND M. FARACH, An alphabet independent approach to two-dimensional pattern matching, SIAM J. Comput., 23 (1994), pp. 313-323.
3. [Ba] T.P. 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.
4. [Bi] R.S. BIRD, Two dimensional pattern matching, Inform. Process. Lett., 6 (1977), pp. 168-170.
5. [Br] D. BRESLAUER, Dictionary-matching on unbounded alphabet: Uniform-length dictionaries, in Proceedings of the 5th Symposium on Combinatorial Pattern Matching, Lecture Notes in Comput. Sci. 807, Springer, New York, 1994, pp. 184-197.
6. [CCG] R. COLE, M. CROCHEMORE, Z. GALIL, L. GA̧SIENIEC, 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 IEEE Symposium on the Foundations of Computer Science, Palo Alto, CA, 1993, pp. 248-258.
7. [CPR] M. CROCHEMORE, Z. GAUL, L. GA̧SIENIEC, K. PARK, AND W. RYTTER, Constant-time randomized parallel string matching, SIAM J. Comput., 26 (1997), pp. 950-960.
8. [CMR] M. CROCHEMORE, L. GA̧SIENIEC, R. HARIHARAN, S. MUTHUKRISHNAN, AND W. RYTTER, A constant time optimal parallel algorithm for two-dimensional pattern matching, SIAM J. Comput., 27 (1998), pp. 668-681.
9. [CPP] A. CZUMAJ, Z. GALIL, L. GA̧SIENIEC, K. PARK, AND W. PLANDOWSKI, Work-time optimal parallel algorithms for string problems, in Proceedings of the 27th ACM Symposium on the Theory of Computing, Las Vegas, NM, 1995, pp. 713-722.
10. [Fa] M. FARACH, Optimal suffix tree construction with large alphabets, in Proceedings of the 38th IEEE Symposium on the Foundations of Computer Science, Miami Beach, FL, 1997, pp. 137-143.
11. [FFM] M. FARACH-COLTON, P. FERRAGINA, AND S. MUTHUKRISHNAN, On the sorting-complexity of suffix tree construction, J. ACM, 47 (2000), pp. 987-1011.
12. [GP] Z. GALIL AND K. PARK, Alphabet-independent two-dimensional witness computation, SIAM J. Comput., 25 (1996), pp. 907-935.
13. [GPP] Z. GALIL, J.G. PARK, AND K. PARK, Three-dimensional pattern matching, in Proceedings of the 9th ACM Symposium on Parallel Algorithms and Architectures, Newport, RI, 1997, pp. 53-62.
14. [HT] D. HAREL AND R.E. TARJAN, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., 13 (1984), pp. 338-355.
15. [Ja] J. JAJA, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1992.
16. [KR] M. KARPINSKI AND W. RYTTER, Alphabet-independent optimal parallel search for three-dimensional patterns, Theoret. Comput. Sci., 205 (1998), pp. 243-260.
17. [KMP] D.E. KNUTH, J.H. MORRIS, JR., AND V.R. PRATT, Fast pattern matching in strings, SIAM J. Comput., 6 (1977), pp. 323-350.
18. [LV] G.M. LANDAU AND U. VISHKIN, Fast parallel and serial approximate string matching, J. Algorithms, 10 (1989), pp. 157-169.
19. [ScV] B. SCHIEBER AND U. VISHKIN, On finding lowest common ancestors: Simplification and parallelization, SIAM J. Comput., 17 (1988), pp. 1253-1262.
20. [Vi] U. VISHKIN, Optimal parallel pattern matching in strings, Inform, and Control, 67 (1985), pp. 91-113.
21. [Vis] U. VISHKIN, Deterministic sampling-A new technique for fast pattern, matching, SIAM J. Comput., 20 (1991), pp. 22-40.