Investigation of block-sorting of multiset permutations
From MaRDI portal
Recommendations
- An analysis of the Burrows-Wheeler transform
- scientific article; zbMATH DE number 1305460
- Universal data compression based on the Burrows-Wheeler transformation: theory and practice
- The Burrows-Wheeler transform between data compression and combinatorics on words
- Word-based text compression using the Burrows-Wheeler transform
Cites work
- A locally adaptive data compression scheme
- A Method for the Construction of Minimum-Redundancy Codes
- scientific article; zbMATH DE number 1862357 (Why is no real title available?)
- Interval and recency rank source coding: Two on-line adaptive variable-length schemes
- Inversion Coding
- Lexical Permutation Sorting Algorithm
- Second step algorithms in the Burrows-Wheeler compression algorithm
- Universal data compression based on the Burrows-Wheeler transformation: theory and practice
Cited in
(8)- Block sorting-based transformations on words: beyond the magic BWT
- From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
- On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
- Word-based text compression using the Burrows-Wheeler transform
- Can Burrows-Wheeler transform be replaced in chain code compression?
- Universal data compression based on the Burrows-Wheeler transformation: theory and practice
- Lexical Permutation Sorting Algorithm
- On fixed points of the Burrows-Wheeler transform
This page was built for publication: Investigation of block-sorting of multiset permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4652742)
