Fast two-dimensional approximate pattern matching

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

Volumn 1380, Issue , 1998, Pages 341-351

  Baeza Yates, Ricardo ^a   Navarro, Gonzalo ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; ONE DIMENSIONAL; PATTERN MATCHING;

APPROXIMATE PATTERN MATCHING; APPROXIMATE STRING MATCHING; AVERAGE COMPLEXITY; FILTERING ALGORITHM; INSERTIONS AND DELETIONS; MULTI PATTERNS; SEARCH ALGORITHMS; TIME COMPLEXITY;

DYNAMIC PROGRAMMING;

EID: 84868240962     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054334     Document Type: Conference Paper

References (23)

1. A. Amir and M. Farach. Efficient 2-dimensional approximate matching of non-rectangular figures. In Proc. SODA '91, pages 212-223, 1991.
2. A. Amir and G. Landau. Fast parallel and serial multidimensional approximate array matching. Theoretical Computer Science, 81:97-115, 1991.
3. R. Baeza-Yates. Similarity in two dimensional strings. Dept. of Computer Science, University of Chile, 1996.
4. R. Baeza-Yates and G. Navarro. A faster algorithm for approximate string matching. In Proc. CPM'96, LNCS 1075, pages 23,1996.ftp://ftp.dcc.uchile.cl/-pub/users/gnavarro/cpm96.ps.gz.
5. R. Baeza-Yates and G. Navarro. Multiple approximate string matching. In Proc. WADS'97, LNCS 1272, pages 174-184, 1997. ftp://ftp.dcc.uchile.cl/pub/-users/gnavarro/vads97.ps.gz.
6. R. Baeza-Yates and C. Perleberg. Fast and practical approximate pattern matching. In Proc. CPM'92, LNCS 644, pages 185-192, 1992.
7. R. Baeza-Yates and M. Regnier. Fast two dimensional pattern matching. Information Processing Letters, 45:51-57, 1993.
8. T. Baker. A technique for extending rapid exact string matching to arrays of more than one dimension. SIAM Journal on Computing, 7:533-541, 1978.
9. R. Bird. Two dimensional pattern matching. Inf. Proc. Letters, 6:168-170, 1977.
10. W. Chang and J. Lampe. Theoretical and empirical comparisons of approximate string matching algorithms. In Proc. CPM'92, LNCS 644, pages 172-181, 1992.
11. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, Oxford, UK, 1994.
12. J. Karkkainen and E. Ukkonen. Two and higher dimensional pattern matching in optimal expected time. In Proc. SODA '94, pages 715-723. SIAM, 1994.
13. K. Krithivasan. Efficient two-dimensional parallel and serial approximate pattern matching. Technical Report CAR-TR-259, University of Maryland, 1987.
14. K. Krithivasan and R. Sitalakshmi. Efficient two-dimensional pattern matching in the presence of errors. Information Sciences, 43:169-184, 1987.
15. G. Landau and U. Vishkin. Fast string matching with k differences. J. of Computer Systems Science, 37:63-78, 1988.
16. R. Muth and U. Manber. Approximate multiple string search. In Proc. CPM'96, LNCS 1075, pages 75-86, 1996.
17. G. Navarro. Multiple approximate string matching by counting. In Proc. WSP'97, pages 125-139,1997. ftp://ftp.dcc.uchile.cl/pub/users/gnavarro/-wsp97.1.ps.gz.
18. K. Park. Analysis of two dimensional approximate pattern matching algorithms. In Proc. CPM'96, LNCS 1075, pages 335-347, 1996.
19. P. Sellers. The theory and computation of evolutionary distances: pattern recognition. J. of Algorithms, 1:359-373, 1980.
20. E. Sutinen and J. Tarhio. On using g-gram locations in approximate string matching. In Proc. ESA '95, LNCS 979, 1995.
21. Esko Ukkonen. Finding approximate patterns in strings. J. of Algorithms, 6:132137, 1985.
22. S. Wu and U. Manber. Fast text searching allowing errors. CACM, 35(10):83-91, October 1992.
23. S. Wu, U. Manber, and E. Myers. A sub-quadratic algorithm for approximate limited expression matching. Algorithmica, 15(l):50-67, 1996.