Back to Search Start Over

Faster two-dimensional pattern matching with rotations

Authors :
Amir, Amihood
Kapah, Oren
Tsur, Dekel
Source :
Theoretical Computer Science. Dec2006, Vol. 368 Issue 3, p196-204. 9p.
Publication Year :
2006

Abstract

Abstract: The most efficient currently known algorithms for two-dimensional pattern matching with rotations have a worst case time complexity of , where the size of the text is and the size of the pattern is . In this paper we present a new algorithm for the problem whose running time is . [Copyright &y& Elsevier]

Subjects

Subjects :
*ALGORITHMS
*COMPUTATIONAL complexity
*ALGEBRA
*MACHINE theory

Details

Language :
English
ISSN :
03043975
Volume :
368
Issue :
3
Database :
Academic Search Index
Journal :
Theoretical Computer Science
Publication Type :
Academic Journal
Accession number :
23222059
Full Text :
https://doi.org/10.1016/j.tcs.2006.09.012
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details