Longest previous non-overlapping factors table computation

DOI10.1007/978-3-319-71147-8_35MaRDI QIDQ1708645zbMATH OpenOpenAlexFDO

Authors Supaporn Chairungsee, Maxime Crochemore

Publication date 26 March 2018

Full work available at URL https://doi.org/10.1007/978-3-319-71147-8_35

zbMATH Keywords

data compressionlongest previous non-overlapping factortext compressionaugmented position heapsuffix heap

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Efficient approaches to compute longest previous non-overlapping factor array
• Computing longest previous non-overlapping factors
• Efficient algorithms for three variants of the LPF table
• Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
• Reversing longest previous factor tables is hard

Cited in

(6)

• Reversing longest previous factor tables is hard
• Efficient approaches to compute longest previous non-overlapping factor array
• Longest previous overlapping factor array
• Computing the longest previous factor
• Computing longest previous non-overlapping factors
• On the computation of longest previous non-overlapping factors

This page was built for publication: Longest previous non-overlapping factors table computation

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