Two-dimensional pattern matching with rotations

Theoretical Computer Science

Volumn 314, Issue 1-2, 2004, Pages 173-187

  Amir, Amihood ^a,b   Butman, Ayelet ^a   Crochemore, Maxime ^c,d   M Landau, Gad ^e,f   Schaps, Mary ^a  

^a BAR ILAN UNIVERSITY   (Israel)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITÉ GUSTAVE EIFFEL   (France)

^d KING'S COLLEGE LONDON   (United Kingdom)

^e UNIVERSITY OF HAIFA   (Israel)

^f POLYTECHNIC UNIVERSITY   (United States)

Author keywords

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

Indexed keywords

ALGORITHMS; ARRAYS; COMPUTATIONAL METHODS; COMPUTER SCIENCE; COMPUTER VISION; ERROR ANALYSIS; PROBLEM SOLVING; ROTATION; SCANNING;

DESIGN AND ANALYSIS OF ALGORITHMS; TWO-DIMENSIONAL PATTERN MATCHING;

PATTERN MATCHING;

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

References (18)

1. Abrahamson K. Generalized string matching. SIAM J. Comput. 16(6):1987;1039-1051.
2. Amir A., Butman A., Lewenstein M. Real scaled matching. Inform. Process. Lett. 70(4):1999;185-190.
3. Amir A., Farach M. Two dimensional dictionary matching. Inform. Process. Lett. 44:1992;233-239.
4. Amir A., Landau G. Fast parallel and serial multidimensional approximate array matching. Theoret. Comput. Sci. 81:1991;97-115.
5. A. Apostolico, Z. Galil (Eds.), Pattern Matching Algorithms, Oxford University Press, Oxford, 1997.
6. R. Baeza-Yates, G. Valiente, An image similarity measure based on graph matching, in: Proc. 7th Symp. String Processing and Information Retrieval (SPIRE'2000), IEEE Computer Society Press, Silverspring, MD, 2000, pp. 28-38.
7. Crochemore M., Rytter W. Text Algorithms. 1994;Oxford University Press, Oxford.
8. M.J. Fischer, M.S. Paterson, String matching and other products, in: R.M. Karp (Ed.), Complexity of Computation, SIAM-AMS Proc., Vol. 7, 1974, 113-125.
9. K. Fredriksson, G. Navarro, E. Ukkonen, An index for two dimensional string matching allowing rotations, in: Proc. IFIP International Conference on Theoretical Computer Science (IFIP TCS), Lecture Notes in Computer Science, Vol. 1872, Springer, Berlin, 2000, pp. 59-75.
10. K. Fredriksson, G. Navarro, E. Ukkonen, Optimal exact and fast approximate two dimensional pattern matching allowing rotations, in: Proc. 13th Annu. Symp. Combinatorial Pattern Matching (CPM 2002), Lecture Notes in Computer Science, Vol. 2373, Springer, Berlin, 2000, pp. 235-248.
11. K. Fredriksson, E. Ukkonen, A rotation invariant filter for two-dimensional string matching, in: Proc. 9th Annu. Symp. Combinatorial Pattern Matching (CPM 98), Lecture Notes in Computer Science, Vol. 1448, Springer, Berlin, 1998, pp. 118-125.
12. K. Fredriksson, E. Ukkonen, Combinatorial methods for approximate pattern matching under rotations and translations in 3D arrays, in: Proc. 7th Symp. String Processing and Information Retrieval (SPIRE'2000), IEEE Computer Society Press, Silverspring, MD, 2000, pp. 96-104.
13. Giancarlo R., Grossi R. On the construction of classes of suffix trees for square matrices. algorithms and applications Inform. Comput. 130(2):1996;151-182.
14. D. Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge University Press, Cambridge, 1997.
15. Hardy G.H., Wright E.M. An Introduction to the Theory of Numbers. 5th Edition:1979;Clarendon Press, Oxford.
16. P. Indyk, R. Motwani, S. Venkatasubramanian, Geometric matching under noise: combinatorial bounds and algorithms, in: Proc. 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999, pp. 354-360.
17. Landau G.M., Vishkin U. Pattern matching in a digitized image. Algorithmica. 12(3/4):1994;375-408.
18. L. Schulman, D. Cardoze, Pattern matching for spatial point sets, Proc. 39th IEEE FOCS, 1998, pp. 156-165.