Lightweight algorithms for constructing and inverting the BWT of string collections
From MaRDI portal
Publication:390898
DOI10.1016/J.TCS.2012.02.002zbMATH Open1292.68176OpenAlexW2051511420MaRDI QIDQ390898FDOQ390898
Authors: Markus J. Bauer, Anthony J. Cox, Giovanna Rosone 
Publication date: 9 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.002
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
Protein sequences, DNA sequences (92D20) Analysis of algorithms (68W40) Algorithms on strings (68W32)
Cites Work
- Linear work suffix array construction
- Indexing compressed text
- Combinatorial Pattern Matching
- Space efficient linear time construction of suffix arrays
- Fast BWT in small space by blockwise suffix sorting
- An extension of the Burrows-Wheeler transform
- A new combinatorial approach to sequence comparison
- Lightweight BWT construction for very large string collections
- Linear-time construction of suffix arrays (extended abstract)
- Lightweight data indexing and compression in external memory
- Linear Time Suffix Array Construction Using D-Critical Substrings
- A space and time efficient algorithm for constructing compressed suffix arrays
Cited In (33)
- Full-text indexes for high-throughput sequencing
- Title not available (Why is that?)
- Detecting mutations by eBWT
- The Burrows-Wheeler transform between data compression and combinatorics on words
- Computing the multi-string BWT and LCP array in external memory
- Space-efficient computation of the LCP array from the Burrows-Wheeler transform
- Wheeler languages
- External memory BWT and LCP computation for sequence collections with applications
- Lightweight merging of compressed indices based on BWT variants
- An external-memory algorithm for string graph construction
- Wheeler graphs: a framework for BWT-based data structures
- A four-stage algorithm for updating a Burrows-Wheeler transform
- Lightweight BWT construction for very large string collections
- Bidirectional Variable-Order de Bruijn Graphs
- Algorithms to compute the Burrows-Wheeler similarity distribution
- Lightweight LCP construction for very large collections of strings
- Computing the original eBWT faster, simpler, and with less memory
- Lightweight data indexing and compression in external memory
- Suffix array and Lyndon factorization of a text
- Lightweight data indexing and compression in external memory
- Efficient construction of the BWT for repetitive text using string compression
- Divide and conquer computation of the multi-string BWT and LCP array
- Space-efficient construction of compressed suffix trees
- Constructing and indexing the bijective and extended Burrows-Wheeler transform
- Prefix-free parsing for building big BWTs
- Haplotype-aware graph indexes
- Computing all-vs-all MEMs in run-length-encoded collections of HiFi reads
- Burrows-Wheeler transform and LCP array construction in constant space
- The ring: worst-case optimal joins in graph databases using (almost) no extra space
- Comparing DNA sequence collections by direct comparison of compressed text indexes
- Sorting conjugates and suffixes of words in a multiset
- Inducing enhanced suffix arrays for string collections
- A new class of string transformations for compressed text indexing
Uses Software
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)
