A constant-space comparison-based algorithm for computing the Burrows-Wheeler transform
From MaRDI portal
Recommendations
- Computing the Burrows-Wheeler transform in place and in small space
- Computing the BWT and the LCP array in constant space
- Burrows-Wheeler transform and LCP array construction in constant space
- Fast BWT in small space by blockwise suffix sorting
- Average linear time and compressed space construction of the Burrows-Wheeler transform
Cited in
(16)- A faster implementation of online run-length Burrows-Wheeler transform
- A survey of string orderings and their application to the Burrows-Wheeler transform
- A simple algorithm for computing the document array
- Computing the Burrows-Wheeler transform in place and in small space
- Faster average case low memory semi-external construction of the Burrows-Wheeler transform
- Indeterminate string factorizations and degenerate text transformations
- A bijective variant of the Burrows-Wheeler transform using V-order
- Fast BWT in small space by blockwise suffix sorting
- Computing the BWT and the LCP array in constant space
- Average linear time and compressed space construction of the Burrows-Wheeler transform
- Computing the inverse sort transform in linear time
- Full-text indexes for high-throughput sequencing
- Suffix array and Lyndon factorization of a text
- Binary block order Rouen transform
- Burrows-Wheeler transform and LCP array construction in constant space
- Combinatorial Pattern Matching
This page was built for publication: A constant-space comparison-based algorithm for computing the Burrows-Wheeler transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928562)
