A simple algorithm for computing the Lempel-Ziv factorization - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

A simple algorithm for computing the Lempel-Ziv factorization

Abstract

We give a space-efficient simple algorithm for computing the Lempel-Ziv factorization of a string. For a string of length n over an integer alphabet, it runs in O(n) time independently of alphabet size and uses o(n) additional space.
Fichier principal
Vignette du fichier
KMP.pdf (114.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00620138 , version 1 (14-02-2013)

Identifiers

  • HAL Id : hal-00620138 , version 1

Cite

Maxime Crochemore, Lucian Ilie, William F. Smyth. A simple algorithm for computing the Lempel-Ziv factorization. 18th Data Compression Conference (DCC'08), 2008, United States. pp.482-488. ⟨hal-00620138⟩
134 View
342 Download

Share

Gmail Facebook Twitter LinkedIn More