A sublinear algorithm for two-dimensional string matching

Pattern Recognition Letters

Volumn 17, Issue 8, 1996, Pages 833-838

  Tarhio, Jorma ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Boyer Moore algorithm; Two dimensional string matching

Indexed keywords

ALGORITHMS; ONLINE SYSTEMS; TIME VARYING SYSTEMS;

BOYER MOORE ALGORITHM; RANDOM PATTERNS; RANDOM TEXTS; SUBLINEAR ALGORITHM; TWO DIMENSIONAL STRING MATCHING;

CHARACTER RECOGNITION;

EID: 0030191628     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8655(96)00055-4     Document Type: Article

References (12)

1. Baeza-Yates, R. (1989). String searching algorithms revisited. In: F. Dehne et al., Eds., Proc. Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 382. Springer, Berlin, 75-96.
2. Baeza-Yates, R. and M. Régnier (1993). Fast two-dimensional pattern matching. Inform. Process. Lett. 45, 51-57.
3. Baker, T. (1978). A technique for extending rapid exact-match string matching to arrays more than one dimension. SIAM J. Comput. 7, 533-541.
4. Bird, R. (1977). Two-dimensional pattern matching. Inform. Process. Lett. 6, 168-170.
5. Boyer, R. and S. Moore (1977). A fast string searching algorithm. Comm. ACM 20, 762-772.
6. Galil, Z. and K. Park (1992). Truly alphabet-independent two-dimensional pattern matching. In: Proc. 33st IEEE Annual Symp. on Foundations of Computer Science. IEEE Press, New York, 247-256.
7. Horspool, N. (1980). Practical fast searching in strings. Software Practice & Experience 10, 501-506.
8. Kärkkäinen, J. and E. Ukkonen (1994). Two and higher dimensional pattern matching in optimal expected time. In: Proc. Fifth Symposium on Discrete Algorithms. ACM-SIAM, New York/Philadelphia, 715-723.
9. Kim, J. and J. Shawe-Taylor (1993). Fast expected two dimensional pattern matching. In: R. Baeza-Yates and N. Ziviani, Eds., Proc. First South American Workshop on String Processing, 77-92.
10. Tarhio, J. and E. Ukkonen (1993). Approximate Boyer-Moore string matching. SIAM J. Comput. 22, 243-260.
11. Yao, A. (1979). The complexity of pattern matching for a random string. SIAM J. Comput. 8, 368-387.
12. Zhu, R. and T. Takaoka (1989). A technique for two-dimensional pattern matching. Comm. ACM 32, 1110-1120.