Faster two-dimensional pattern matching with rotations
- Amir, Amihood
- Kapah, Oren
- Tsur, Dekel
Publication date
December 2006
DOI Publisher
Published by Elsevier B.V. ISSN
0304-3975 Citation count (estimate)
12Abstract
AbstractThe most efficient currently known algorithms for two-dimensional pattern matching with rotations have a worst case time complexity of O(n2m3), where the size of the text is n×n and the size of the pattern is m×m. In this paper we present a new algorithm for the problem whose running time is O(n2m2)
Add to ORKG