Bidirectional Text Compression in External Memory

DOI10.4230/LIPICS.ESA.2019.41MaRDI QIDQ5075783zbMATH OpenOpenAlexFDO

Authors Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, Manuel Penschuck

Publication date 11 May 2022

Full work available at URL https://arxiv.org/abs/1907.03235

zbMATH Keywords

bidirectional parsingexternal algorithmstext compressiontext decompression

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• LZ78 compression in low main memory space
• LZRR: LZ77 parsing with right reference
• Bidirectional adaptive compression
• Smaller Fully-Functional Bidirectional BWT Indexes
• Bicriteria data compression

Cites work

• At the roots of dictionary compression: string attractors
• Compression with the tudocomp framework
• Data compression via textual substitution
• Engineering external memory LCP array construction: parallel, in-place and large alphabet
• LCP array construction in external memory
• Lempel-Ziv factorization powered by space efficient suffix trees
• Lightweight data indexing and compression in external memory
• Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
• Linear-time text compression by longest-first substitution
• Longest substring palindrome after edit
• LZ-End Parsing in Linear Time
• On the approximation ratio of Lempel-Ziv parsing
• On the bit-complexity of Lempel-Ziv compression
• Parallel External Memory Suffix Sorting
• Permuted Longest-Common-Prefix Array
• Suffix Arrays: A New Method for On-Line String Searches

Cited in

(2)

• LZRR: LZ77 parsing with right reference
• Computing NP-hard repetitiveness measures via MAX-SAT

Describes a project that uses

Uses Software

• STXXL

This page was built for publication: Bidirectional Text Compression in External Memory

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