Similarity in two-dimensional strings

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

Volumn 1449, Issue , 1998, Pages 319-328

  Baeza Yates, Ricardo A ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

APPROXIMATE PATTERN MATCHING; APPROXIMATE STRING MATCHING; EDIT DISTANCE; SIMILARITY MEASURE;

COMBINATORIAL MATHEMATICS;

EID: 38049069919     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68535-9_36     Document Type: Conference Paper

References (15)

1. A. Amir and M. Farach. Efficient 2-dimensional approximate matching of nonrectangular figures. In Proc. SODA'91, pages 212-223, San Francisco, CA, Jan 1991. 320.
2. A. Amir and G. Landau. Fast parallel and serial multidimensional approximate array matching. Theoretical Computer Science, 81: 97-115, 1991. Also as report CS-TR-2288, Dept. of Computer Science, Univ. of Maryland, 1989. 320.
3. M. Atallah. A linear time algorithm for the Hausdorff distance between convex polygons, Information Processing Letters 17, 207-209, 1983. 321.
4. R. Baeza-Yates and G. Navarro. Fast two-dimensional approximate string matching. In LATIN'98, Campinas, Brazil, April 1998. Springer-Verlag LNCS 1380, edited by C. Lucchesi and A. Moura, 341-351. 320, 325.
5. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, Oxford, UK, 1994. 320.
6. C. Faloutsos, R. Barber, M. Flickner, J. Hafner, W. Niblack, D. Petkovic, and W. Equitz. Efficient and effective querying by image content. J. of Intelligent Information Systems, 3: 231-262, 1994. 321.
7. M. Flickner, H. Sawhney, W. Niblack, J. Ashley, Q. Huang, B. Dom, M. Gorkani, J. Hafner, D. Petkovic, and W. Equitz. 321.
8. R. Giancarlo. A generalization of suffix trees to square matrices, with applications. SIAM J. on Computing, 24: 520-562, 1995. 321.
9. 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. 320, 326.
10. K. Krithivasan. Efficient two-dimensional parallel and serial approximate pattern matching. Technical Report CAR-TR-259, University of Maryland, 1987. 320.
11. K. Krithivasan and R. Sitalakshmi. Efficient two-dimensional pattern matching in the presence of errors. Information Sciences, 43: 169-184, 1987. 319.
12. K. Park. Analysis of two dimensional approximate pattern matching algorithms. In Proc. CPM'96, LNCS 1075, pages 335-347, 1996. 320.
13. S. Ranka and T. Heywood. Two-dimensional pattern matching with k mismatches. Pattern recognition, 24(1): 31-40, 1991. 320.
14. P. Sellers. The theory and computation of evolutionary distances: pattern recognition. J. of Algorithms, 1: 359-373, 1980. 319.
15. P. Suetens, P. Fua, and A. Hanson. Computational Strategies for Object Recognition, ACM Computing Surveys, 24: 5-62, 1992. 321.