An analysis of the Burrows-Wheeler transform
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1305460
- A Simpler Analysis of Burrows-Wheeler Based Compression
- A simpler analysis of Burrows-Wheeler-based compression
- Universal data compression based on the Burrows-Wheeler transformation: theory and practice
- Burrows-Wheeler compression: Principles and reflections
Cited in
(94)- Burrows-Wheeler transform and Sturmian words
- Faster entropy-bounded compressed suffix trees
- Context exhumation after the Burrows-Wheeler transform
- Approximate string matching with compressed indexes
- Wheeler graphs: a framework for BWT-based data structures
- Measuring the clustering effect of BWT via RLE
- Burrows-Wheeler transform and run-length enconding
- Practical compressed suffix trees
- High-order entropy compressed bit vectors with rank/select
- Fixed block compression boosting in FM-indexes: theory and practice
- A note on the Burrows-Wheeler transformation
- Analyzing relative Lempel-Ziv reference construction
- On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
- Fast compressed self-indexes with deterministic linear-time construction
- New space/time tradeoffs for top-\(k\) document retrieval on sequences
- Efficient chain code compression with interpolative coding
- Lempel-Ziv-like parsing in small space
- When a dollar makes a BWT
- Lempel-Ziv compressed structures for document retrieval
- The alternating BWT: an algorithmic perspective
- Computing the Burrows-Wheeler transform in place and in small space
- Improved and extended locating functionality on compressed suffix arrays
- Parameterized analysis of paging and list update algorithms
- Top-k term-proximity in succinct space
- The myriad virtues of wavelet trees
- Succinct 2D dictionary matching
- Stronger Lempel-Ziv based compressed text indexing
- Wavelet trees for all
- Burrows-Wheeler compression: Principles and reflections
- A simpler analysis of Burrows-Wheeler-based compression
- From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
- Fast BWT in small space by blockwise suffix sorting
- Faster suffix sorting
- Compressing table data with column dependency
- Rank and select revisited and extended
- Word-based text compression using the Burrows-Wheeler transform
- Space-efficient substring occurrence estimation
- Succinct dynamic cardinal trees
- Can Burrows-Wheeler transform be replaced in chain code compression?
- Compressed string dictionary search with edit distance one
- Second step algorithms in the Burrows-Wheeler compression algorithm
- Fully functional static and dynamic succinct trees
- Locally compressed suffix arrays
- General document retrieval in compact space
- Random access to high-order entropy compressed text
- Computing the Burrows-Wheeler Transform of a String and Its Reverse
- Two combinatorial criteria for BWT images
- Self-indexing based on LZ77
- Full-text indexes for high-throughput sequencing
- Universal data compression based on the Burrows-Wheeler transformation: theory and practice
- Access, rank, and select in grammar-compressed strings
- Compressed Data Structures for Dynamic Sequences
- Most Burrows-Wheeler Based Compressors Are Not Optimal
- Damaged BZip Files Are Difficult to Repair
- Universal Entropy Estimation Via Block Sorting
- Optimal partitions of strings: a new class of Burrows-Wheeler compression algorithms
- Quasi-distinct Parsing and Optimal Compression Methods
- Colored range queries and document retrieval
- On compressing and indexing repetitive sequences
- Bounds from a card trick
- Quasi-distinct parsing and optimal compression methods
- Monge properties of sequence alignment
- scientific article; zbMATH DE number 1305460 (Why is no real title available?)
- Lexical Permutation Sorting Algorithm
- scientific article; zbMATH DE number 2006809 (Why is no real title available?)
- scientific article; zbMATH DE number 2051173 (Why is no real title available?)
- On fixed points of the Burrows-Wheeler transform
- Investigation of block-sorting of multiset permutations
- FUNCTIONAL PEARL Inverting the Burrows–Wheeler transform
- Efficient fully-compressed sequence representations
- A framework for succinct labeled ordinal trees over large alphabets
- Fast entropy-bounded string dictionary look-up with mismatches
- A new class of searchable and provably highly compressible string transformations
- Compressed Multiple Pattern Matching
- Fast Compressed Self-Indexes with Deterministic Linear-Time Construction
- On undetected redundancy in the Burrows-Wheeler transform
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Lazy Lempel-Ziv factorization algorithms
- Faster compressed suffix trees for repetitive collections
- A Simpler Analysis of Burrows-Wheeler Based Compression
- The Burrows-Wheeler transform between data compression and combinatorics on words
- Balancing and clustering of words in the Burrows-Wheeler transform
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Space efficient algorithms for the Burrows-Wheeler backtransformation
- A new class of string transformations for compressed text indexing
- Finding range minima in the middle: approximations and applications
- On optimally partitioning a text to improve its compression
- Dynamic rank/select structures with applications to run-length encoded texts
- Rank/select on dynamic compressed sequences and applications
- Large alphabets and incompressibility
- Dynamic Shannon coding
- A simple storage scheme for strings achieving entropy bounds
- Move-to-front, distance coding, and inversion frequencies revisited
- Wee LCP
This page was built for publication: An analysis of the Burrows-Wheeler transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196619)
