Computing the Longest Previous Factor - Archive ouverte HAL Access content directly
Journal Articles European Journal of Combinatorics Year : 2013

Computing the Longest Previous Factor

Maxime Crochemore
Lucian Ilie
  • Function : Author
Costas S. Iliopoulos
  • Function : Author
  • PersonId : 992344
Tomasz Walen
  • Function : Author

Abstract

The Longest Previous Factor array gives, for each position i in a string y, the length of the longest factor (substring) of y that occurs both at i and to the left of i in y. The Longest Previous Factor array is central in many text compression techniques as well as in the most efficient algorithms for detecting motifs and repetitions occurring in a text. Computing the Longest Previous Factor array requires usually the Suffix Array and the Longest Common Prefix array. We give the first time-space optimal algorithm that computes the Longest Previous Factor array, given the Suffix Array and the Longest Common Prefix arrays. We also give the first linear-time algorithm that computes the permutation that applied to the Longest Common Prefix array produces the Longest Previous Factor array.
Fichier principal
Vignette du fichier
ComputingLPF.pdf (165.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

  • HAL Id : hal-01806294 , version 1

Cite

Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, et al.. Computing the Longest Previous Factor. European Journal of Combinatorics, 2013. ⟨hal-01806294⟩
17 View
89 Download

Share

Gmail Facebook Twitter LinkedIn More