See this document in CiteSeerX!

An Index for Two Dimensional String Matching Allowing Rotations (2000)  (Make Corrections)  (13 citations)
Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
IFIP TCS



  Home/Search   Context   Related

 
View or download:
dcc.uchile.cl/pub/user...rotindex.ps.gz
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  dcc.uchile.cl/DCC/inves...reports (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We present an index to search a two-dimensional pattern of size m × m in a two-dimensional text of size n × n, even when the pattern appears rotated in the text. The index is based on suffix trees. By using O(n 2 ) space the index can search the pattern in O(m 5 ) worst case time and in O(log oe (n) 5=2 ) on average, where oe is the alphabet size. A larger index of size O(n 2 log oe (n) 3=2 ) yields an average search time of O(log oe n). We also discuss alternative matching models. (Update)

Similar documents based on text:   More   All
0.7:   Optimal Exact and Fast Approximate Two Dimensional.. - Fredriksson, Navarro, .. (2002)   (Correct)
0.7:   Faster Than FFT: Rotation Invariant Combinatorial.. - Fredriksson, Navarro.. (2002)   (Correct)
0.6:   An Index for Two Dimensional String Matching Allowing.. - Fredriksson, Navarro.. (2000)   (Correct)

BibTeX entry:   (Update)

K. Fredriksson, G. Navarro, and E. Ukkonen. An index for two dimensional string matching allowing rotations. In IFIP TCS2000, 2000. To appear. http://citeseer.ist.psu.edu/article/fredriksson00index.html   More

@inproceedings{ fredriksson00index,
    author = "Kimmo Fredriksson and Gonzalo Navarro and Esko Ukkonen",
    title = "An Index for Two Dimensional String Matching Allowing Rotations",
    booktitle = "{IFIP} {TCS}",
    pages = "59--75",
    year = "2000",
    url = "citeseer.ist.psu.edu/article/fredriksson00index.html" }
Citations (may not include all citations):
47   New indices for text: PAT trees and PAT arrays (context) - Gonnet, Baeza-Yates et al. - 1992
22   Approximate string matching over suffix trees - Ukkonen - 1993
16   Combinatorial methods for approximate image matching under t.. - Fredriksson, Ukkonen
14   A rotation invariant filter for two-dimensional string match.. - Fredriksson, Ukkonen - 1998
14   Combinatorial methods for approximate pattern matching under.. - Fredriksson, Ukkonen
9   A new indexing method for approximate string matching - Navarro, Baeza-Yates - 1999
8   the construction of classes of suffix trees for square matri.. (context) - Giancarlo, Grossi - 1996
6   A generalization of suffix trees to square matrices (context) - Giancarlo - 1995



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.dcc.uchile.cl/DCC/investigacion/reports.html):   More
A New Data Model: Persistent Attribute-Centric Objects - Baeza-Yates, Jones, al. (1999)   (Correct)
Fast Approximate String Matching in a Dictionary - Baeza-Yates, Navarro (1998)   (Correct)
Automatic (Triangular) Mesh Generation Based On.. - Rivara, Hitschfeld..   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC