Lightweight algorithms for constructing and inverting the BWT of string collections
From MaRDI portal
Recommendations
- Lightweight BWT construction for very large string collections
- Computing Burrows-Wheeler similarity distributions for string collections
- Computing the multi-string BWT and LCP array in external memory
- Lightweight data indexing and compression in external memory
- External memory BWT and LCP computation for sequence collections with applications
Cites work
- A new combinatorial approach to sequence comparison
- A space and time efficient algorithm for constructing compressed suffix arrays
- An extension of the Burrows-Wheeler transform
- Combinatorial Pattern Matching
- Fast BWT in small space by blockwise suffix sorting
- Indexing compressed text
- Lightweight BWT construction for very large string collections
- Lightweight data indexing and compression in external memory
- Linear Time Suffix Array Construction Using D-Critical Substrings
- Linear work suffix array construction
- Linear-time construction of suffix arrays (extended abstract)
- Space efficient linear time construction of suffix arrays
Cited in
(33)- Haplotype-aware graph indexes
- Comparing DNA sequence collections by direct comparison of compressed text indexes
- An external-memory algorithm for string graph construction
- Lightweight BWT construction for very large string collections
- Detecting mutations by eBWT
- Constructing and indexing the bijective and extended Burrows-Wheeler transform
- Bidirectional Variable-Order de Bruijn Graphs
- Suffix array and Lyndon factorization of a text
- Wheeler graphs: a framework for BWT-based data structures
- Space-efficient computation of the LCP array from the Burrows-Wheeler transform
- Algorithms to compute the Burrows-Wheeler similarity distribution
- External memory BWT and LCP computation for sequence collections with applications
- A four-stage algorithm for updating a Burrows-Wheeler transform
- The ring: worst-case optimal joins in graph databases using (almost) no extra space
- Space-efficient construction of compressed suffix trees
- Full-text indexes for high-throughput sequencing
- Prefix-free parsing for building big BWTs
- The Burrows-Wheeler transform between data compression and combinatorics on words
- Computing all-vs-all MEMs in run-length-encoded collections of HiFi reads
- Wheeler languages
- Lightweight data indexing and compression in external memory
- Lightweight data indexing and compression in external memory
- Lightweight LCP construction for very large collections of strings
- scientific article; zbMATH DE number 7559192 (Why is no real title available?)
- Lightweight merging of compressed indices based on BWT variants
- Efficient construction of the BWT for repetitive text using string compression
- Inducing enhanced suffix arrays for string collections
- Sorting conjugates and suffixes of words in a multiset
- Burrows-Wheeler transform and LCP array construction in constant space
- Divide and conquer computation of the multi-string BWT and LCP array
- Computing the original eBWT faster, simpler, and with less memory
- A new class of string transformations for compressed text indexing
- Computing the multi-string BWT and LCP array in external memory
This page was built for publication: Lightweight algorithms for constructing and inverting the BWT of string collections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390898)
