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).
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 | |
State | Published - 2004 |
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 |
Bibliographical 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.
Funding
∗ 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.
Funders | Funder number |
---|---|
National Science Foundation | CCR-01-04494 |
Israel Science Foundation | 282/01 |
Keywords
- Design and analysis of algorithms
- Rotation
- Two dimensional pattern matching