Faster two-dimensional pattern matching with rotations

Amihood Amir, Oren Kapah, Dekel Tsur

Research output: Contribution to journalArticlepeer-review

16 Scopus citations

Abstract

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).

Original languageEnglish
Pages (from-to)196-204
Number of pages9
JournalTheoretical Computer Science
Volume368
Issue number3
DOIs
StatePublished - 10 Dec 2006

Bibliographical note

Funding Information:
∗ Corresponding author. Tel.: +972 3 531 8770; fax: +972 3 736 0498. E-mail addresses: amir@cs.biu.ac.il (A. Amir), kapaho@cs.biu.ac.il (O. Kapah), dekelts@cs.haifa.ac.il (D. Tsur). 1Partly supported by NSF Grant CCR-01-04494 and ISF Grant 282/01.

Keywords

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

Fingerprint

Dive into the research topics of 'Faster two-dimensional pattern matching with rotations'. Together they form a unique fingerprint.

Cite this