Bit catastrophes for the Burrows-Wheeler transform
From MaRDI portal
Publication:6067330
DOI10.1007/978-3-031-33264-7_8OpenAlexW4377081593MaRDI QIDQ6067330
Sara Giuliani, Marinella Sciortino, Shunsuke Inenaga, Cristian Urbina, Zsuzsanna Lipták, Giuseppe Romana
Publication date: 16 November 2023
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-33264-7_8
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Novel results on the number of runs of the Burrows-Wheeler-transform
- Burrows-Wheeler transform and Sturmian words
- Some combinatorial properties of Sturmian words
- Sturmian words: structure, combinatorics, and their arithmetics
- Measuring the clustering effect of BWT via RLE
- On extremal cases of Hopcroft's algorithm
- Towards a definitive measure of repetitiveness
- Logarithmic equal-letter runs for BWT of purely morphic words
- Refining the \(r\)-index
- Burrows-Wheeler transform of words defined by morphisms
- Sensitivity of string compressors and repetitiveness measures
- On Christoffel classes
- Fast Pattern Matching in Strings
- Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
- Suffix Automata and Standard Sturmian Words
- Combinatorial Pattern Matching
