Two- and higher-dimensional pattern matching in optimal expected time

SIAM Journal on Computing

Volumn 29, Issue 2, 1999, Pages 571-589

  Kärkkäinen, Juha ^a   Ukkonen, Esko ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; RANDOM PROCESSES;

APPROXIMATE MATCHING; AVERAGE CASE ANALYSIS; MULTIDIMENSIONAL PATTERN MATCHING;

COMPUTATIONAL GEOMETRY;

EID: 0343777442     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794275872     Document Type: Article

References (26)

1. A. V. AHO AND M. J. CORASICK, Efficient string matching: An aid to bibliographic search, Comm. ACM, 18 (1975), pp. 333-340.
2. 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. A. AMIR AND M. FARACH, Efficient 2-dimensional approximate matching of non-rectangular figures, in Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, 1991, pp. 212-223.
4. A. AMIR AND G. M. LANDAU, Fast parallel and serial multidimensional approximate pattern matching, Theoretical Comput. Sci., 81 (1991), pp. 97-115.
5. R. BAEZA-YATES AND M. RÉGNIER, Fast two-dimensional pattern matching, Inform. Process. Lett., 45 (1993), pp. 51-57.
6. 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.
7. R. S. BIRD, Two dimensional pattern matching, Inform. Process. Lett., 6 (1977), pp. 168-170.
8. R. S. BOYER AND J. S. MOORE, A fast string searching algorithm, Comm. ACM, 20 (1977), pp. 762-772.
9. W. I. CHANG AND E. L. LAWLER, Approximate string matching in sublinear expected time, in Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1990, pp. 116-124.
10. M. CROCHEMORE, L. GA̧SIENIEC, W. PLANDOWSKI, AND W. RYTTER, Two-dimensional pattern matching in linear time and small space, in Proceedings of the 12th Symposium on Theoretical Aspects of Computer Science, vol. 900 of LNCS, Springer, New York, 1995, pp. 181-192.
11. M. CROCHEMORE, L. GA̧SIENIEC, AND W. RYTTER, Two-dimensional pattern matching by sampling, Inform. Process. Lett., 46 (1993), pp. 159-162.
12. M. CROCHEMORE AND W. RYTTER, Text Algorithms, Oxford University Press, 1994.
13. Z. GALIL AND K. PARK, Alphabet-independent two-dimensional witness computation, SIAM J. Comput., 25 (1996), pp. 907-935.
14. G. H. GONNET, Efficient searching of text and pictures (extended abstract), Technical Report OED-88-02, Centre for the New OED, University of Waterloo, Waterloo, Ontario, Canada, 1988.
15. A. HUME AND D. M. SUNDAY, Fast string searching, Software - Practice and Experience, 21 (1991), pp. 1221-1248.
16. R. M. KARP AND M. O. RABIN, Efficient randomized pattern-matching algorithms, IBM J. Res. Dev., 31 (1987), pp. 249-260.
17. J. Y. KIM AND J. SHAWE-TAYLOR, Fast expected two dimensional pattern matching, in Proceedings of the 1st South American Workshop on String Processing, 1993, pp. 77-92.
18. D. E. KNUTH, J. H. MORRIS, AND V. R. PRATT, Fast pattern matching in strings, SIAM J. Comput., 6 (1977), pp. 323-350.
19. K. KRITHIVASAN AND R. SITALAKSHMI, Efficient two-dimensional pattern matching in the presence of errors, Inform. Sci., 43 (1987), pp. 169-184.
20. K. PARK, Analysis of two-dimensional approximate pattern matching algorithms (Note), Theoret. Comput. Sci., 201 (1998), pp. 263-273.
21. S. RANKA AND T. HEYWOOD, Two-dimensional pattern matching with k mismatches, Pattern Recognition, 24 (1991), pp. 31-40.
22. M. RÉGNIER AND L. ROSTAMI, A simple (but optimal) 2d-witness algorithm, in Proceedings of the 3rd South American Workshop on String Processing, Carleton University Press, 1996, pp. 243-256.
23. J. TARHIO, A sublinear algorithm for two-dimensional string matching, Pattern Recognition Letters, 17 (1996), pp. 833-838.
24. E. UKKONEN, Approximate string-matching with q-grams and maximal matches, Theoret. Comput. Sci., 92 (1992), pp. 191-211.
25. A. C. YAO, The complexity of pattern, matching for a random string, SIAM J. Comput., 8 (1979), pp. 368-387.
26. R. F. ZHU AND T. TAKAOKA, A technique for two-dimensional pattern matching, Comm. ACM, 32 (1989), pp. 1110-1120.