Faster Two Dimensional Pattern Matching with Rotations

A. Amihood; Oren Kapah; Dekel Tsur

Faster Two Dimensional Pattern Matching with Rotations

A. Amihood, Oren Kapah, Dekel Tsur

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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

Original language	American English
Title of host publication	15th Annual Symposium, CPM 2004
Editors	Suleyman Cenk, Sahinalp S. Muthukrishnan, Ugur Dogrusoz
Publisher	Springer Berlin Heidelberg
State	Published - 2004

Bibliographical note

Place of conference:Istanbul, Turkey

Cite this

@inproceedings{044f028ee959435ab2276f5f8bfd001c,

title = "Faster Two Dimensional Pattern Matching with Rotations",

abstract = "The most efficient currently known algorithms for two dimensional matching with rotation have a worst case time complexity of O(n 2 m 3), where the size of the text is n 2 and the size of the pattern is m 2. In this paper we present two algorithms for the two dimensional rotated matching problem whose running time is O(n 2 m 2). The preprocessing time of the first algorithms is O(m 5) and the preprocessing time of the second algorithm is O(m 4).",

author = "A. Amihood and Oren Kapah and Dekel Tsur",

note = "Place of conference:Istanbul, Turkey",

year = "2004",

language = "American English",

editor = "Suleyman Cenk and Muthukrishnan, {Sahinalp S.} and Ugur Dogrusoz",

booktitle = "15th Annual Symposium, CPM 2004",

publisher = "Springer Berlin Heidelberg",

}

TY - GEN

T1 - Faster Two Dimensional Pattern Matching with Rotations

AU - Amihood, A.

AU - Kapah, Oren

AU - Tsur, Dekel

N1 - Place of conference:Istanbul, Turkey

PY - 2004

Y1 - 2004

N2 - The most efficient currently known algorithms for two dimensional matching with rotation have a worst case time complexity of O(n 2 m 3), where the size of the text is n 2 and the size of the pattern is m 2. In this paper we present two algorithms for the two dimensional rotated matching problem whose running time is O(n 2 m 2). The preprocessing time of the first algorithms is O(m 5) and the preprocessing time of the second algorithm is O(m 4).

AB - The most efficient currently known algorithms for two dimensional matching with rotation have a worst case time complexity of O(n 2 m 3), where the size of the text is n 2 and the size of the pattern is m 2. In this paper we present two algorithms for the two dimensional rotated matching problem whose running time is O(n 2 m 2). The preprocessing time of the first algorithms is O(m 5) and the preprocessing time of the second algorithm is O(m 4).

UR - https://scholar.google.co.il/scholar?q=Faster+Two+Dimensional+Pattern+Matching+with+Rotations%2C+Amir+Amihood+&btnG=&hl=en&as_sdt=0%2C5

M3 - Conference contribution

BT - 15th Annual Symposium, CPM 2004

A2 - Cenk, Suleyman

A2 - Muthukrishnan, Sahinalp S.

A2 - Dogrusoz, Ugur

PB - Springer Berlin Heidelberg

ER -

Faster Two Dimensional Pattern Matching with Rotations

Abstract

Bibliographical note

Other files and links

Fingerprint

Cite this