Order-Preserving Indexing - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2016

Order-Preserving Indexing


Kubica et al. (Information Processing Letters, 2013) and Kim et al. (Theoretical Computer Science, 2014) introduced order-preserving pattern matching: for a given text the goal is to find its factors having the same 'shape' as a given pattern. Known results include a linear-time algorithm for this problem (in case of polynomially-bounded alphabet) and a generalization to multiple patterns. We propose an index that enables order-preserving pattern matching queries in time proportional to pattern length. The index can be constructed in O(n log log n) expected time or O(n log n) deterministic time. The index is an incomplete order-preserving suffix tree which may miss a single edge label at each branching node. For most applications such incomplete suffix trees provide the same functional power as the complete ones. We show a number of their applications, including computation of longest common factors, longest previously occurring factors and squares in a string in the order-preserving setting. We also give an O(n √ log n)-time algorithm $ A preliminary version of this paper appeared in the constructing complete order-preserving suffix trees.
Fichier principal
Vignette du fichier
op_suftree.pdf (367.9 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01806293 , version 1 (01-06-2018)


  • HAL Id : hal-01806293 , version 1


Maxime Crochemore, S Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, et al.. Order-Preserving Indexing. Theoretical Computer Science, 2016. ⟨hal-01806293⟩
43 View
319 Download


Gmail Facebook Twitter LinkedIn More