Faster two-dimensional pattern matching with rotations

Theoretical Computer Science

Volumn 368, Issue 3, 2006, Pages 196-204

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

^a BAR ILAN UNIVERSITY   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

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

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; PROBLEM SOLVING; ROTATION;

RUNNING TIME; TIME COMPLEXITY; TWO-DIMENSIONAL PATTERN MATCHING;

PATTERN MATCHING;

EID: 33751217458     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.09.012     Document Type: Article

References (18)

1. A. Amir, G. Benson, M. Farach, Alphabet independent two-dimensional matching, in: Proc. 24th ACM Symp. on Theory of Computation, 1992, pp. 59-68.
2. Amir A., Butman A., Crochemore M., Landau G.M., and Schaps M. Two-dimensional pattern matching with rotations. Theoret. Comput. Sci. 314 1-2 (2004) 173-187
3. Amir A., Butman A., and Lewenstein M. Real scaled matching. Inform. Proces. Lett. 70 4 (1999) 185-190
4. A. Amir, A. Butman, M. Lewenstein, E. Porat, Real two-dimensional scaled matching, in: Proc. Eighth Workshop on Algorithms and Data Structures (WADS), 2003, pp. 353-364.
5. Amir A., and Landau G. Fast parallel and serial multidimensional approximate array matching. Theoret. Comput. Sci. 81 (1991) 97-115
6. A. Amir, G. Landau, U. Vishkin, Efficient pattern matching with scaling, in: Proc. First Symp. on Discrete Algorithms, San Fransisco, CA, 1990, pp. 344-357.
7. A. Apostolico, Z.Galil (Eds.), Pattern Matching Algorithms, Oxford University Press, Oxford, 1997.
8. Baker T. A technique for extending rapid exact-match string matching to arrays of more than one dimension. SIAM J. Comput. 7 (1978) 533-541
9. Bird R. Two-dimensional pattern matching. Information Process. Lett. 6 5 (1977) 168-170
10. Crochemore M., and Rytter W. Text Algorithms (1994), Oxford University Press, Oxford
11. M. Farach, Optimal suffix tree construction with large alphabets, in: Proc. 38th IEEE Symp. on Foundations of Computer Science, 1997, pp. 137-143.
12. K. Fredriksson, G. Navarro, E. Ukkonen, An index for two-dimensional string matching allowing rotations, in: Proc. IFIP Internat. Conf. on Theoretical Computer Science (IFIP TCS), Lecture Notes on Computer Science, Vol. 1872, 2000, pp. 59-75.
13. K. Fredriksson, G. Navarro, E. Ukkonen, Optimal exact and fast approximate two dimensional pattern matching allowing rotations, in: Proc. 13th Annu. Symp. on Combinatorial Pattern Matching (CPM), Lecture Notes on Computer Science, Vol. 2373, 2002, pp. 235-248.
14. K. Fredriksson, E. Ukkonen, A rotation invariant filter for two-dimensional string matching, in: Proc. Ninth Ann. Symp. on Combinatorial Pattern Matching (CPM 98), Lecture Notes on Computer Science, Vol. 1448, Springer, 1998, pp. 118-125.
15. K. Fredriksson, E. Ukkonen, Combinatorial methods for approximate pattern matching under rotations and translations in 3d arrays, in: Proc. Seventh Symp. on String Processing and Information Retrieval (SPIRE), 2000, pp. 96-104.
16. Galil Z., and Park K. Alphabet-independent two-dimensional witness computation. SIAM J. Comput. 25 5 (1996) 907-935
17. Gusfield D. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology (1997), Cambridge University Press, Cambridge, MA
18. Landau G.M., and Vishkin U. Pattern matching in a digitized image. Algorithmica 12 3/4 (1994) 375-408