Faster Two Dimensional Pattern Matching with Rotations

Amihood Amir, Oren Kapah, Dekel Tsur

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

17 Scopus citations


The most efficient currently known algorithms for two dimensional matching with rotation have a worst case time complexity of O(n2m 3), where the size of the text is n2 and the size of the pattern is m2. In this paper we present two algorithms for the two dimensional rotated matching problem whose running time is O(n2m2). The preprocessing time of the first algorithms is O(m5) and the preprocessing time of the second algorithm is O(m4).

Original languageEnglish
Title of host publicationCombinatorial Pattern Matching
Subtitle of host publication15th Annual Symposium, CPM 2004, Proceedings
EditorsSuleyman Cenk Sahinalp, S. Muthukrishnan, Ugur Dogrusoz
PublisherSpringer Verlag
Number of pages11
ISBN (Print)354022341X, 9783540223412
StatePublished - 2004
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


  • Design and analysis of algorithms
  • Rotation
  • Two dimensional pattern matching

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Faster Two Dimensional Pattern Matching with Rotations'. Together they form a unique fingerprint.

Cite this