Two-dimensional pattern matching in linear time and small space

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 900, Issue , 1995, Pages 181-192

  Crochemore, Maxime ^a   Gąsieniec, Leszek ^b   Rytter, Wojciech ^b   Plandowski, Wojciech ^b  

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

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS;

DETERMINISTIC SAMPLING; LINEAR-TIME ALGORITHMS; NON-PERIODICITY; PARALLEL PATTERNS; PREPROCESSING PHASE; SELECTION PROBLEMS; SPACE ALGORITHMS; TWO-DIMENSIONAL PATTERN MATCHING;

PATTERN MATCHING;

EID: 84947719729     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59042-0_72     Document Type: Conference Paper

References (14)

1. A. Amir and G. Benson, Two dimensional periodicity and its applications, Proc. 3rd ACM-SIAM SODA'92, p.440-452.
2. A. Amir, G. Benson and M. Farach, Alphabet independent two dimensional matching, Proc. 24th ACM STOC'92, p.59-68.
3. A. Amir, G. Benson and M. Farach, Optimal parallel two dimensional pattern matching, Proc. 5th ACM SPAA'93, p.79-85.
4. T. J. Baker, A technique for extending rapid exact-match string matching to arrays of more than one dimension, SIAM J. Comp. 7 (1978), p.533-541.
5. R. S. Bird, Two dimensional pattern matching, Inf. Proc. Letters 6, (1977) p.168-170.
6. R. Cole, M. Crochemore, Z. Galil, L. Gąsieniec, R. Hariharan, S. Muthukrishnan, K. Park and W. Rytter, Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions, Proc. 34th IEEE FOCS'93, p.248-258.
7. M. Crochemore, String matching for ordered alphabets, TCS 92 (1992), p.225-251.
8. M. Crochemore and D. Perrin, Two-way string matching, JACM 38:3 (1991), p.651-675.
9. M. Crochemore, L. Gąsieniec and W. Rytter, Two-dimensional pattern matching by sampling, IPL 46 (1993), p.159-162.
10. M. Crochemore and W. Rytter, A version of Galil-Park two-dimensional matching, Report IGM 94-05, Universite Marne la Valle (1994).
11. Z. Galil and K. Park, Truly alphabet independent two dimensional matching, Proc. 33th IEEE FOCS'92, (1992) p.247-256.
12. Z. Galil and J. Seiferas, Time-space optimal 'string matching, J. Comp. Syst. Sc. 26 (1983), p.280-294.
13. L. Gąsieniec, W. Plandowski and W. Rytter, The zooming method: a recursive approach to time-space efficient string-matching, TCS, to appear.
14. U. Vishkin, Deterministic sampling - a new technique for fast pattern matching, SIAM J. Comput. 20 (1991), p. 22-40.