Faster two-dimensional pattern matching with rotations

Amihood Amir; Oren Kapah; Dekel Tsur

doi:10.1016/j.tcs.2006.09.012

Faster two-dimensional pattern matching with rotations

Amihood Amir
, Oren Kapah
, Dekel Tsur

Research output: Contribution to journal › Article › peer-review

20 Scopus citations

Abstract

The most efficient currently known algorithms for two-dimensional pattern matching with rotations have a worst case time complexity of O (n² m³), 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 (n² m²).

Original language	English
Pages (from-to)	196-204
Number of pages	9
Journal	Theoretical Computer Science
Volume	368
Issue number	3
DOIs	https://doi.org/10.1016/j.tcs.2006.09.012
State	Published - 10 Dec 2006

Keywords

Design and analysis of algorithms
Rotation
Two-dimensional pattern matching

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1016/j.tcs.2006.09.012

Cite this

@article{a385b88a8a0c470789fdeb56a5edc9e3,

title = "Faster two-dimensional pattern matching with rotations",

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

keywords = "Design and analysis of algorithms, Rotation, Two-dimensional pattern matching",

author = "Amihood Amir and Oren Kapah and Dekel Tsur",

year = "2006",

month = dec,

day = "10",

doi = "10.1016/j.tcs.2006.09.012",

language = "English",

volume = "368",

pages = "196--204",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - Faster two-dimensional pattern matching with rotations

AU - Amir, Amihood

AU - Kapah, Oren

AU - Tsur, Dekel

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 -

Faster two-dimensional pattern matching with rotations

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this