Bit catastrophes for the Burrows-Wheeler transform
From MaRDI portal
Cites work
- r-indexing the eBWT
- A theoretical and experimental analysis of BWT variants for string collections
- A universal algorithm for sequential data compression
- An extension of the Burrows-Wheeler transform
- Bit catastrophes for the Burrows-Wheeler transform
- Burrows-Wheeler transform and Sturmian words
- Burrows-Wheeler transform of words defined by morphisms
- Circular Sturmian words and Hopcroft's algorithm
- Combinatorial Pattern Matching
- Compression of individual sequences via variable-rate coding
- Computing the original eBWT faster, simpler, and with less memory
- Fast Pattern Matching in Strings
- Fully functional suffix trees and optimal text searching in BWT-runs bounded space
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 6850405 (Why is no real title available?)
- scientific article; zbMATH DE number 2230164 (Why is no real title available?)
- Lempel-Ziv: a ``one-bit catastrophe but not a tragedy
- Logarithmic equal-letter runs for BWT of purely morphic words
- Measuring the clustering effect of BWT via RLE
- Novel results on the number of runs of the Burrows-Wheeler-transform
- On extremal cases of Hopcroft's algorithm
- On the number of equal-letter runs of the bijective Burrows-Wheeler transform
- Refining the \(r\)-index
- Sensitivity of string compressors and repetitiveness measures
- Some combinatorial properties of Sturmian words
- Sturmian words, Lyndon words and trees
- Sturmian words: structure, combinatorics, and their arithmetics
- Suffix Automata and Standard Sturmian Words
- The Burrows-Wheeler transform between data compression and combinatorics on words
- Toward a Definitive Compressibility Measure for Repetitive Sequences
This page was built for publication: Bit catastrophes for the Burrows-Wheeler transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6986752)
