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

17 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	Combinatorial Pattern Matching
Subtitle of host publication	15th Annual Symposium, CPM 2004, Proceedings
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 - 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.), Combinatorial Pattern Matching: 15th Annual Symposium, CPM 2004, Proceedings (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. Combinatorial Pattern Matching: 15th Annual Symposium, CPM 2004, Proceedings. 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{7eb5650969f64502b3d7498493586f65,

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

note = "Funding Information: ∗ Corresponding author. Tel.: +972 3 531 8770; fax: +972 3 736 0498. E-mail addresses: [email protected] (A. Amir), [email protected] (O. Kapah), [email protected] (D. Tsur). 1Partly supported by NSF Grant CCR-01-04494 and ISF Grant 282/01.",

year = "2004",

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 = "Combinatorial Pattern Matching",

address = "Germany",

}

Amir, A, Kapah, O & Tsur, D 2004, Faster Two Dimensional Pattern Matching with Rotations. in SC Sahinalp, S Muthukrishnan & U Dogrusoz (eds), Combinatorial Pattern Matching: 15th Annual Symposium, CPM 2004, Proceedings. 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.
Combinatorial Pattern Matching: 15th Annual Symposium, CPM 2004, Proceedings. 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

N1 - Funding Information: ∗ Corresponding author. Tel.: +972 3 531 8770; fax: +972 3 736 0498. E-mail addresses: [email protected] (A. Amir), [email protected] (O. Kapah), [email protected] (D. Tsur). 1Partly supported by NSF Grant CCR-01-04494 and ISF Grant 282/01.

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(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 - http://www.scopus.com/inward/record.url?scp=35048897441&partnerID=8YFLogxK

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 - Combinatorial Pattern Matching

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, Combinatorial Pattern Matching: 15th Annual Symposium, CPM 2004, Proceedings. 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

Other files and links

Fingerprint

Cite this