Abstract
The problem of pattern matching with rotation is that of finding all occurrences of a two-dimensional pattern in a text, in all possible rotations. We prove an upper and lower bound on the number of such different possible rotated patterns. Subsequently, given an m x m array (pattern) and an n x n array (text) over some finite alphabet Σ, we present a new method yielding an O(n2m3) time algorithm for this problem. © Springer-Verlag Berlin Heidelberg 2003.
Author supplied keywords
Cite
CITATION STYLE
Amir, A., Butman, A., Crochemore, M., Landau, G. M., & Schaps, M. (2003). Two-dimensional pattern matching with rotations. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2676, 17–31. https://doi.org/10.1007/3-540-44888-8_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
