TY - JOUR
T1 - Faster two-dimensional pattern matching with rotations
AU - Amir, Amihood
AU - Kapah, Oren
AU - Tsur, Dekel
N1 - Funding Information:
∗ Corresponding author. Tel.: +972 3 531 8770; fax: +972 3 736 0498. E-mail addresses: [email protected] (A. Amir), [email protected] (O. Kapah), [email protected] (D. Tsur). 1Partly supported by NSF Grant CCR-01-04494 and ISF Grant 282/01.
PY - 2006/12/10
Y1 - 2006/12/10
N2 - The most efficient currently known algorithms for two-dimensional pattern matching with rotations have a worst case time complexity of O (n2 m3), 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 (n2 m2).
AB - The most efficient currently known algorithms for two-dimensional pattern matching with rotations have a worst case time complexity of O (n2 m3), 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 (n2 m2).
KW - Design and analysis of algorithms
KW - Rotation
KW - Two-dimensional pattern matching
UR - https://www.scopus.com/pages/publications/33751217458
U2 - 10.1016/j.tcs.2006.09.012
DO - 10.1016/j.tcs.2006.09.012
M3 - Article
AN - SCOPUS:33751217458
SN - 0304-3975
VL - 368
SP - 196
EP - 204
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 3
ER -