Measuring the clustering effect of BWT via RLE
From MaRDI portal
Publication:1676309
DOI10.1016/j.tcs.2017.07.015zbMath1380.68174OpenAlexW2736821863WikidataQ60692291 ScholiaQ60692291MaRDI QIDQ1676309
Marinella Sciortino, Antonio Restivo, Giovanna Rosone, Luca Versari, Sabrina Mantaci
Publication date: 6 November 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.07.015
Related Items (7)
Logarithmic equal-letter runs for BWT of purely morphic words ⋮ A new class of string transformations for compressed text indexing ⋮ Bit catastrophes for the Burrows-Wheeler transform ⋮ Algorithms to compute the Burrows-Wheeler similarity distribution ⋮ A combinatorial view on string attractors ⋮ The alternating BWT: an algorithmic perspective ⋮ A new class of searchable and provably highly compressible string transformations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Permuting operations on strings and their relation to prime numbers
- Balancing and clustering of words in the Burrows-Wheeler transform
- Burrows-Wheeler transformations and de Bruijn words
- Burrows-Wheeler transform and Sturmian words
- Words with simple Burrows-Wheeler transforms
- Burrows-Wheeler transform and palindromic richness
- A simpler analysis of Burrows-Wheeler-based compression
- An analysis of the Burrows—Wheeler transform
- Most Burrows-Wheeler Based Compressors Are Not Optimal
- Boosting textual compression in optimal linear time
- A locally adaptive data compression scheme
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- A universal algorithm for sequential data compression
- Combinatorial Pattern Matching
- On Artin's conjecture.
This page was built for publication: Measuring the clustering effect of BWT via RLE
