Computing Longest Previous Factor in linear time and applications - Archive ouverte HAL Access content directly
Journal Articles Information Processing Letters Year : 2008

Computing Longest Previous Factor in linear time and applications

Abstract

We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of the longest factor of w starting at position i that occurs previously in w. Several properties and applications of LPF are investigated. They include computing the Lempel-Ziv factorization of a string and detecting all repetitions (runs) in a string in linear time independently of the integer alphabet size.
Fichier principal
Vignette du fichier
IPL07.pdf (134.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

Maxime Crochemore, Lucian Ilie. Computing Longest Previous Factor in linear time and applications. Information Processing Letters, 2008, 106 (2), pp.75-80. ⟨10.1016/j.ipl.2007.10.006⟩. ⟨hal-00619691⟩
164 View
1164 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More