LPF computation revisited

DOI10.1007/978-3-642-10217-2_18MaRDI QIDQ3651543zbMATH OpenOpenAlexFDO

Authors Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Waleń

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

suffix arraylongest previous factortext compressiondetection of repetitionsZiv-Lempel factorisation

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Efficient algorithms for three variants of the LPF table
• Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
• Computing longest previous non-overlapping factors
• Computing longest previous factor in linear time and applications
• Computing the longest previous factor

Cited in

(13)

• On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
• Efficient algorithms for three variants of the LPF table
• Parameterized longest previous factor
• Computing longest previous factor in linear time and applications
• Computing regularities in strings: a survey
• scientific article; zbMATH DE number 2040809 (Why is no real title available?)
• Efficient approaches to compute longest previous non-overlapping factor array
• Note on the greedy parsing optimality for dictionary-based text compression
• Computing the longest previous factor
• Computing longest previous non-overlapping factors
• Lempel-Ziv Factorization Revisited
• On the computation of longest previous non-overlapping factors
• Lazy Lempel-Ziv factorization algorithms

This page was built for publication: LPF computation revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3651543)