Faster two dimensional pattern matching with rotations

Amihood Amir; Oren Kapah; Dekel Tsur

doi:10.1007/978-3-540-27801-6_31

Faster two dimensional pattern matching with rotations

Amihood Amir
, Oren Kapah
, Dekel Tsur

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

18 Scopus citations

Abstract

The most efficient currently known algorithms for two dimensional matching with rotation have a worst case time complexity of O(n²m ³), where the size of the text is n² 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(n²m²). The preprocessing time of the first algorithms is O(m⁵) and the preprocessing time of the second algorithm is O(m⁴).

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Suleyman Cenk Sahinalp, S. Muthukrishnan, Ugur Dogrusoz
Publisher	Springer Verlag
Pages	409-419
Number of pages	11
ISBN (Print)	354022341X, 9783540223412
DOIs	https://doi.org/10.1007/978-3-540-27801-6_31
State	Published - 1 Jan 2004
Externally published	Yes

Publication series

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

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.1007/978-3-540-27801-6_31

Cite this

Amir, A., Kapah, O., & Tsur, D. (2004). Faster two dimensional pattern matching with rotations. In S. C. Sahinalp, S. Muthukrishnan, & U. Dogrusoz (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 409-419). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3109). Springer Verlag. https://doi.org/10.1007/978-3-540-27801-6_31

Amir, Amihood ; Kapah, Oren ; Tsur, Dekel. / Faster two dimensional pattern matching with rotations. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Suleyman Cenk Sahinalp ; S. Muthukrishnan ; Ugur Dogrusoz. Springer Verlag, 2004. pp. 409-419 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{7326b82d147f4efc9e07c60567c2e5f0,

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

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

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

year = "2004",

month = jan,

day = "1",

doi = "10.1007/978-3-540-27801-6\_31",

language = "English",

isbn = "354022341X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "409--419",

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

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "Germany",

}

Amir, A, Kapah, O & Tsur, D 2004, Faster two dimensional pattern matching with rotations. in SC Sahinalp, S Muthukrishnan & U Dogrusoz (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3109, Springer Verlag, pp. 409-419. https://doi.org/10.1007/978-3-540-27801-6_31

Faster two dimensional pattern matching with rotations. / Amir, Amihood; Kapah, Oren; Tsur, Dekel.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Suleyman Cenk Sahinalp; S. Muthukrishnan; Ugur Dogrusoz. Springer Verlag, 2004. p. 409-419 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3109).

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

TY - CHAP

T1 - Faster two dimensional pattern matching with rotations

AU - Amir, Amihood

AU - Kapah, Oren

AU - Tsur, Dekel

PY - 2004/1/1

Y1 - 2004/1/1

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

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

KW - Design and analysis of algorithms

KW - Rotation

KW - Two dimensional pattern matching

UR - https://www.scopus.com/pages/publications/35048897441

U2 - 10.1007/978-3-540-27801-6_31

DO - 10.1007/978-3-540-27801-6_31

M3 - Chapter

AN - SCOPUS:35048897441

SN - 354022341X

SN - 9783540223412

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 409

EP - 419

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Sahinalp, Suleyman Cenk

A2 - Muthukrishnan, S.

A2 - Dogrusoz, Ugur

PB - Springer Verlag

ER -

Amir A, Kapah O, Tsur D. Faster two dimensional pattern matching with rotations. In Sahinalp SC, Muthukrishnan S, Dogrusoz U, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2004. p. 409-419. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-27801-6_31

Faster two dimensional pattern matching with rotations

Abstract

Publication series

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this