Fast multi-dimensional approximate pattern matching

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

Volumn 1645, Issue , 1999, Pages 243-257

  Navarro, Gonzalo ^a   Baeza Yates, Ricardo ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; ERRORS; LEARNING ALGORITHMS;

APPROXIMATE PATTERN MATCHING; APPROXIMATE STRING MATCHING; INSERTIONS AND DELETIONS; MULTI DIMENSIONAL; SEARCH ALGORITHMS; SEARCHING ALGORITHMS; STRING MATCHING; SUBLINEAR TIME;

PATTERN MATCHING;

EID: 84957638272     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48452-3_18     Document Type: Conference Paper

References (22)

1. A. Aho and M. Corasick. Efficient string matching: an aid to bibliographic search. CACM, 18(6):333-340, June 1975.
2. A. Amir and G. Calinescu. Alphabet independent and dictionary scaled matching. In Proc. CPM’96, number 1075 in LNCS, pages 320-334, 1996.
3. A. Amir and M. Farach. Efficient 2-dimensional approximate matching of non-rectangular figures. In Proc. SODA’91, pages 212-223, 1991.
4. A. Amir and G. Landau. Fast parallel and serial multidimensional approximate array matching. Theoretical Computer Science, 81:97-115, 1991.
5. R. Baeza-Yates. Similarity in two-dimensional strings. In Proc. COCOON’98, number 1449 in LNCS, pages 319-328, Taipei, Taiwan, August 1998.
6. R. Baeza-Yates and G. Navarro. Fast two-dimensional approximate pattern matching. In Proc. LATIN’98, number 1380 in LNCS, pages 341-351. Springer-Verlag, 1998.
7. R. Baeza-Yates and G. Navarro. Faster approximate string matching. Algorith-mica, 23(2):127-158, 1999. To appear. Preliminary version in Proc. CPM’96.
8. R. Baeza-Yates and C. Perleberg. Fast and practical approximate pattern matching. In Proc. CPM’92, LNCS 644, pages 185-192, 1992.
9. R. Baeza-Yates and M. Regnier. Fast two dimensional pattern matching. Information Processing Letters, 45:51-57, 1993.
10. 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.
11. R. Bird. Two dimensional pattern matching. Inf. Proc. Letters, 6:168-170, 1977.
12. B. Commentz-Walter. A string matching algorithm fast on the average. In Proc. ICALP’79, number 6 in LNCS, pages 118-132. Springer-Verlag, 1979.
13. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, Oxford, UK, 1994.
14. K. Fredriksson and E. Ukkonen. A rotation invariant filter for two-dimensional string matching. In Proc. CPM’98, number 1448 in LNCS, pages 118-125, 1998.
15. J. Karkkäinen and E. Ukkonen. Two and higher dimensional pattern matching in optimal expected time. In Proc. SODA’94, pages 715-723. SIAM, 1994.
16. K. Krithivasan. Efficient two-dimensional parallel and serial approximate pattern matching. Technical Report CAR-TR-259, University of Maryland, 1987.
17. K. Krithivasan and R. Sitalakshmi. Efficient two-dimensional pattern matching in the presence of errors. Information Sciences, 43:169-184, 1987.
18. S. Needleman and C. Wunsch. A general method applicable to the search for similarities in the amino acid sequences of two proteins. J. of Molecular Biology, 48:444-453, 1970.
19. K. Park. Analysis of two dimensional approximate pattern matching algorithms. In Proc. CPM’96, LNCS 1075, pages 335-347, 1996.
20. P. Sellers. The theory and computation of evolutionary distances: pattern recognition. J. of Algorithms, 1:359-373, 1980.
21. S. Wu and U. Manber. Fast text searching allowing errors. CACM, 35(10):83-91, October 1992.
22. R. Zhu and T. Takaoka. A technique for two-dimensional pattern matching. Comm. ACM, 32(9):1110-1120, 1989.