Faster two dimensional pattern matching with rotations

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

Volumn 3109, Issue , 2004, Pages 409-419

  Amir, Amihood ^a,b   Kapah, Oren ^a   Tsur, Dekel ^c  

^a BAR ILAN UNIVERSITY   (Israel)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF HAIFA   (Israel)

Author keywords

Design and analysis of algorithms; Rotation; Two dimensional pattern matching

Indexed keywords

PATTERN MATCHING; ROTATION;

DESIGN AND ANALYSIS OF ALGORITHMS; MATCHING PROBLEMS; PREPROCESSING TIME; RUNNING TIME; TIME COMPLEXITY; TWO-DIMENSIONAL PATTERN MATCHING;

ALGORITHMS;

EID: 35048897441     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27801-6_31     Document Type: Article

References (18)

1. A.V. Aho and M.J. Corasick. Efficient string matching. Comm. ACM, 18(6):333-340, 1975.
2. A. Amir, A. Butman, M. Crocehmore, G.M. Landau, and M. Schaps. Two-dimensional pattern matching with rotations. In Proc. 14th Annual Symposium on Combinatorial Pattern Matching (CPM 2003), number 2676 in LNCS, pages 17-31. Springer, 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), pages 353-364, 2003.
5. A. Amir and M. Farach. Two dimensional dictionary matching. Information Processing Letters, 44:233-239, 1992.
6. A. Amir and G. Landau. Fast parallel and serial multidimensional approximate array matching. Theoretical Computer Science, 81:97-115, 1991.
7. A. Apostolico and Z. Galil (editors). Pattern Matching Algorithms. Oxford University Press, 1997.
8. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994.
9. M.J. Fischer and M.S. Paterson. String matching and other products. Complexity of Computation, R.M. Karp (editor), SIAM-AMS Proceedings, 7:113-125, 1974.
10. K. Fredriksson, V. Mäkinen, and G. Navarro. Rotation and lighting invariant template matching. In Proceedings of the 6th Latin American Symposium on Theoretical Informatics (LATIN'04), LNCS, 2004. To appear. Available at http://www.dec.uchile.cl/~gnavarro/ps/latin04.ps.gzx.
11. K. Fredriksson, G. Navarro, and E. Ukkonen. An index for two dimensional string matching allowing rotations. In Prof. IFIP International Conference on Theoretical Computer Science (IFIP TCS), volume 1872 of LNCS, pages 59-75. Springer, 2000.
12. K. Fredriksson, G. Navarro, and E. Ukkonen. Optimal exact and fast approximate two dimensional pattern matching allowing rotations. In Proc. 13th Annual Symposium on Combinatorial Pattern Matching (CPM), volume 2373 of LNCS, pages 235-248. Springer, 2002.
13. 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), pages 118-125. Springer, LNCS 1448, 1998.
14. K. Fredriksson and E. Ukkonen. A rotation invariant filter for two-dimensional string matching. In Proc. 9th Annual Symposium on Combinatorial Pattern Matching (CPM), volume 1448 of LNCS, pages 118-125. Springer, 1998.
15. K. Fredriksson and E. Ukkonen. Combinatorial methods for approximate pattern matching under rotations and translations in 3d arrays. In Proc. 7th Symposium on String Processing and Information Retrieval (SPIRE'2000), pages 96-104. IEEE CS Press, 2000.
16. R. Giancarlo and R. Grossi. On the construction of classes of suffix trees for square matrices: Algorithms and applications. Information and Computation, 130(2):151-182, 1996.
17. Dan Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.
18. G. M. Landau and U. Vishkin. Pattern matching in a digitized image. Algorithmica, 12(3/4):375-408, 1994.