Two-Dimensional Pattern Matching with Rotations

A. Amihood; A Butman; M Crochemore; G. M Landau; M Schaps

Two-Dimensional Pattern Matching with Rotations

A. Amihood, A Butman, M Crochemore, G. M Landau, M Schaps

Department of Computer Science

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

Abstract

The problem of pattern matching with rotation is that of finding all occurrences of a two-dimensional pattern in a text, in all possible rotations. We prove an upper and lower bound on the number of such different possible rotated patterns. Subsequently, given an m × m array (pattern) and an n × n array (text) over some finite alphabet Σ, we present a new method yielding an O(n 2 m 3) time algorithm for this problem.

Original language	American English
Title of host publication	Annual Symposium on Combinatorial Pattern Matching
Editors	Ricardo Baeza-Yates, Edgar Chávez, Maxime Crochemore
Publisher	Springer Berlin Heidelberg
State	Published - 2003

Bibliographical note

Place of conference:Morelia, Michoacán, Mexico

Cite this

@inproceedings{7ae285c96e494544acea26e79665f0f2,

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

abstract = "The problem of pattern matching with rotation is that of finding all occurrences of a two-dimensional pattern in a text, in all possible rotations. We prove an upper and lower bound on the number of such different possible rotated patterns. Subsequently, given an m × m array (pattern) and an n × n array (text) over some finite alphabet Σ, we present a new method yielding an O(n 2 m 3) time algorithm for this problem.",

author = "A. Amihood and A Butman and M Crochemore and Landau, \{G. M\} and M Schaps",

note = "Place of conference:Morelia, Michoac{\'a}n, Mexico",

year = "2003",

language = "American English",

editor = "Ricardo Baeza-Yates and Edgar Ch{\'a}vez and Maxime Crochemore",

booktitle = "Annual Symposium on Combinatorial Pattern Matching",

publisher = "Springer Berlin Heidelberg",

}

TY - GEN

T1 - Two-Dimensional Pattern Matching with Rotations

AU - Amihood, A.

AU - Butman, A

AU - Crochemore, M

AU - Landau, G. M

AU - Schaps, M

N1 - Place of conference:Morelia, Michoacán, Mexico

PY - 2003

Y1 - 2003

N2 - The problem of pattern matching with rotation is that of finding all occurrences of a two-dimensional pattern in a text, in all possible rotations. We prove an upper and lower bound on the number of such different possible rotated patterns. Subsequently, given an m × m array (pattern) and an n × n array (text) over some finite alphabet Σ, we present a new method yielding an O(n 2 m 3) time algorithm for this problem.

AB - The problem of pattern matching with rotation is that of finding all occurrences of a two-dimensional pattern in a text, in all possible rotations. We prove an upper and lower bound on the number of such different possible rotated patterns. Subsequently, given an m × m array (pattern) and an n × n array (text) over some finite alphabet Σ, we present a new method yielding an O(n 2 m 3) time algorithm for this problem.

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

M3 - Conference contribution

BT - Annual Symposium on Combinatorial Pattern Matching

A2 - Baeza-Yates, Ricardo

A2 - Chávez, Edgar

A2 - Crochemore, Maxime

PB - Springer Berlin Heidelberg

ER -

Two-Dimensional Pattern Matching with Rotations

Abstract

Bibliographical note

Other files and links

Fingerprint

Cite this