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.
|Title of host publication||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Editors||Ricardo Baeza-Yates, Edgar Chavez, Maxime Crochemore|
|Number of pages||15|
|ISBN (Print)||3540403116, 9783540403111|
|State||Published - 2003|
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
Bibliographical noteFunding Information:
Part of this research was conducted while the 2rst and fourth authors were visiting the University of Marne-La-Vall;ee supported by Arc-en-Ciel/Keshet, French–Israeli Scienti2c and Technical Cooperation Program. ∗Corresponding author. E-mail addresses: email@example.com (A. Amir), firstname.lastname@example.org (A. Butman), email@example.com (G. M. Landau), firstname.lastname@example.org (M. Schaps). 1Partially supported by NSF grant CCR-01-04494, ISF grant 282/01, and an Israel–France exchange scientist grant funded by the Israel Ministry of Science. 2Partially supported by CNRS, NATO Science Programme grant PST.CLG.977017, and by Arc-en-Ciel/Keshet, French–Israeli Scienti2c and Technical Cooperation Program. 3Partially supported by NSF grants CCR-9610238 and CCR-0104307, by NATO Science Programme grant PST.CLG.977017, by the Israel Science Foundation grants 173/98 and 282/01, by the FIRST Foundation of the Israel Academy of Science and Humanities, by IBM Faculty Partnership Award, and by Arc-en-Ciel/Keshet, French–Israeli Scienti2c and Technical Cooperation Program.
- Design and analysis of algorithms
- Two-dimensional pattern matching
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)