Efficient approaches to compute longest previous non-overlapping factor array

DOI10.3233/FI-2018-1745MaRDI QIDQ4611217zbMATH OpenOpenAlexWikidataFDO

Authors Supaporn Chairungsee

Publication date 17 January 2019

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2018-1745

zbMATH Keywords

augmented position heapdata compressionlongest previous non-overlapping factorposition heapsuffix heaptext compression

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Recommendations

• Computing longest previous non-overlapping factors
• Longest previous non-overlapping factors table computation
• Efficient algorithms for three variants of the LPF table
• Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
• LPF computation revisited

Cited in

(5)

• Longest previous non-overlapping factors table computation
• Computing the longest previous factor
• Computing longest previous non-overlapping factors
• Longest previous overlapping factor array
• On the computation of longest previous non-overlapping factors

This page was built for publication: Efficient approaches to compute longest previous non-overlapping factor array

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