scientific article; zbMATH DE number 7559177

DOI10.4230/LIPIcs.CPM.2019.9MaRDI QIDQ5088897

Takaaki Nishimoto, Yasuo Tabei

Publication date: 18 July 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Burrows-Wheeler transformlossless data compressionLempel-Ziv parsing

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (2)

Engineering Practical Lempel-Ziv Tries ⋮ Refining the \(r\)-index

Cites Work

• Unnamed Item
• Unnamed Item
• Succinct data structures for searchable partial sums with optimal worst-case performance
• LZ77 computation based on the run-length encoded BWT
• A \textit{really} simple approximation of smallest grammar
• Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
• A faster implementation of online RLBWT and its application to LZ77 parsing
• Dynamic relative compression, dynamic partial sums, and substring concatenation
• Log-logarithmic worst-case range queries are possible in space theta(N)
• Optimal bounds for the predecessor problem and related problems
• Alphabet-Dependent String Searching with Wexponential Search Trees
• Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
• Suffix Arrays: A New Method for On-Line String Searches
• On the Complexity of Finite Sequences
• Efficient LZ78 Factorization of Grammar Compressed Text
• Converting SLP to LZ78 in almost Linear Time
• Optimal Construction of Compressed Indexes for Highly Repetitive Texts

This page was built for publication: