Efficient one dimensional real scaled matching

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

Volumn 3246, Issue , 2004, Pages 1-9

  Amir, Amihood ^a   Butman, Ayelet ^b   Lewenstein, Moshe ^a   Porat, Ely ^a   Tsur, Dekel ^c  

^a BAR ILAN UNIVERSITY   (Israel)

^b Institute of Technology   (Israel)

^c UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER VISION; PROBLEM SOLVING;

PROBLEM SOLVING; ONE DIMENSIONAL;

ALGORITHM FOR SOLVING;

EID: 84871103033     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30213-1_1     Document Type: Conference Paper

References (15)

1. A. Amir, A. Apostolico, G. M. Landau, and G. Satta. Efficient text fingerprinting via Parikh mapping. J. of Discrete Algorithms, 1(5-6):409-421, 2003.
2. A. Amir, A. Butman, A. Crochemore, G. M. Landau, and M. Schaps. Twodimensional pattern matching with rotations. In Proc. 14th Annual Symposium on Combinatorial Pattern Matching (CPM '03), pages 17-31, 2003.
3. A. Amir, A. Butman, and M. Lewenstein. Real scaled matching. Information Processing Letters, 70(4):185-190, 1999.
4. A. Amir, A. Butman, M. Lewenstein, and E. Porat. Real two dimensional scaled matching. In Proc. 8th Workshop on Algorithms and Data Structures (WADS '03), pages 353-364, 2003.
5. A. Amir and G. Calinescu. Alphabet independent and dictionary scaled matching. In Proc. 7th Annual Symposium on Combinatorial Pattern Matching (CPM 96), LNCS 1075, pages 320-334. Springer-Verlag, 1996.
6. A. Amir and M. Farach. Efficient 2-dimensional approximate matching of half-rectangular figures. Information and Computation, 118(1):1-11, April 1995.
7. A. Amir, O. Kapah, and D. Tsur. Faster two dimensional pattern matching with rotations. In Proc. 15th Annual Symposium on Combinatorial Pattern Matching (CPM '04), pages 409-419, 2004.
8. A. Amir and G. Landau. Fast parallel and serial multidimensional approximate array matching. Theoretical Computer Science, 81:97-115, 1991.
9. A. Amir, G. M. Landau, and U. Vishkin. Efficient pattern matching with scaling. Journal of Algorithms, 13(1):2-32, 1992.
10. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Comm. ACM, 20:762-772, 1977.
11. G. Didier, T. Schmidt, J. Stoye, and D. Tsur. Character sets of strings. Submitted, 2004.
12. K. Fredriksson and E. Ukkonen. A rotation invariant filter for two-dimensional string matching. In Proc. 9th Annual Symposium on Combinatorial Pattern Matching (CPM 98), LNCS 1448, pages 118-125. Springer, 1998.
13. D. E. Knuth, J. H. Morris, and V. R. Pratt. Fast pattern matching in strings. SIAM J. Comp., 6:323-350, 1977.
14. K. Krithivansan and R. Sitalakshmi. Efficient two dimensional pattern matching in the presence of errors. Information Sciences, 13:169-184, 1987.
15. G. M. Landau and U. Vishkin. Pattern matching in a digitized image. Algorithmica, 12(3/4):375-408, 1994.