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 (path compressed) tries. By using O(n2) (i.e. linear) space the index can search the pattern in O((logσ n)5/2) time on average, where σ is the alphabet size. We also consider various schemes for approximate matching, for which we obtain either O(polylogn) or O(n2λ) search time, where × ≤ 1 in most useful cases. A larger index of size O(n2 (logσ n) 3/2) yields an average time of O(logσ n) for the simplest matching model. The algorithms have applications e.g. in content based information retrieval from image databases. © Springer-Verlag Berlin Heidelberg 2002.
CITATION STYLE
Fredriksson, K., Navarro, G., & Ukkonen, E. (2000). An index for two dimensional string matching allowing rotations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1872 LNCS, pp. 59–75). Springer Verlag. https://doi.org/10.1007/3-540-44929-9_5
Mendeley helps you to discover research relevant for your work.