A simpler analysis of Burrows-Wheeler-based compression
From MaRDI portal
Publication:2465054
DOI10.1016/j.tcs.2007.07.020zbMath1144.68020OpenAlexW2153002377MaRDI QIDQ2465054
Elad Verbin, Shir Landau, Haim Kaplan
Publication date: 19 December 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.07.020
Related Items
The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words ⋮ Measuring the clustering effect of BWT via RLE ⋮ On optimally partitioning a text to improve its compression ⋮ When a dollar makes a BWT ⋮ On the separation and equivalence of paging strategies and other online algorithms ⋮ Balancing and clustering of words in the Burrows-Wheeler transform ⋮ Move-to-front, distance coding, and inversion frequencies revisited ⋮ Parameterized analysis of paging and list update algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Engineering a lightweight suffix array construction algorithm
- Robust universal complete codes for transmission and compression
- Second step algorithms in the Burrows-Wheeler compression algorithm
- Robust transmission of unbounded strings using Fibonacci representations
- An analysis of the Burrows—Wheeler transform
- Boosting textual compression in optimal linear time
- Indexing compressed text
- Data compression
- A locally adaptive data compression scheme
- Universal codeword sets and representations of the integers
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- String Processing and Information Retrieval
- The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression
- A Method for the Construction of Minimum-Redundancy Codes
