| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438754 | Theoretical Computer Science | 2006 | 9 Pages |
Abstract
The 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).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
