LPF Computation Revisited

DOI10.1007/978-3-642-10217-2_18zbMath1267.68170OpenAlexW1830327897MaRDI QIDQ3651543

Maxime Crochemore, Costas S. Iliopoulos, Lucian Ilie, Marcin Kubica, Tomasz Walen, Wojciech Rytter

Publication date: 11 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10217-2_18

zbMATH Keywords

text compressionsuffix arraylongest previous factordetection of repetitionsZiv-Lempel factorisation

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (9)

On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case ⋮ Efficient algorithms for three variants of the LPF table ⋮ Computing longest previous non-overlapping factors ⋮ Parameterized longest previous factor ⋮ Note on the greedy parsing optimality for dictionary-based text compression ⋮ Lempel-Ziv Factorization Revisited ⋮ Computing regularities in strings: a survey ⋮ Computing the longest previous factor ⋮ Lazy Lempel-Ziv Factorization Algorithms

This page was built for publication: LPF Computation Revisited