LPF computation revisited - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

LPF computation revisited

Résumé

We present efficient algorithms for storing past segments of a text. They are computed using two previously computed read-only arrays (SUF and LCP) composing the Suffix Array of the text. They compute the maximal length of the previous factor (subword) occurring at each position of the text in a table called LPF. This notion is central both in many conservative text compression techniques and in the most efficient algorithms for detecting motifs and repetitions occurring in a text. The main results are: a linear-time algorithm that computes explicitly the permutation that transforms the LCP table into the LPF table; a time-space optimal computation of the LPF table; and an O(n log n) strong in-place computation of the LPF table.
Fichier principal
Vignette du fichier
LPF_computation_revisited.pdf (143.27 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00741881 , version 1 (13-02-2013)

Identifiants

  • HAL Id : hal-00741881 , version 1

Citer

Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, et al.. LPF computation revisited. IWOCA, 2009, Czech Republic. pp.158-169. ⟨hal-00741881⟩
85 Consultations
220 Téléchargements

Partager

Gmail Facebook X LinkedIn More