Bidirectional Text Compression in External Memory

DOI10.4230/LIPIcs.ESA.2019.41OpenAlexW2977718060MaRDI QIDQ5075783

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

Publication date: 11 May 2022

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

zbMATH Keywords

text compressionexternal algorithmsbidirectional parsingtext decompression

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

LZRR: LZ77 parsing with right reference

Uses Software

• STXXL

Cites Work

• Unnamed Item
• Lempel-Ziv factorization powered by space efficient suffix trees
• Linear-time text compression by longest-first substitution
• On the approximation ratio of Lempel-Ziv parsing
• Lightweight data indexing and compression in external memory
• On the Bit-Complexity of Lempel--Ziv Compression
• Parallel External Memory Suffix Sorting
• Suffix Arrays: A New Method for On-Line String Searches
• Permuted Longest-Common-Prefix Array
• Data compression via textual substitution
• Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet
• Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
• LZ-End Parsing in Linear Time
• Longest substring palindrome after edit
• At the roots of dictionary compression: string attractors
• LCP Array Construction in External Memory

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