External memory BWT and LCP computation for sequence collections with applications
From MaRDI portal
Recommendations
- Computing the multi-string BWT and LCP array in external memory
- Lightweight LCP construction for very large collections of strings
- LCP array construction in external memory
- Better external memory LCP array construction
- Low space external memory construction of the succinct permuted longest common prefix array
Cites work
- Algorithm Theory - SWAT 2004
- Algorithms on Strings, Trees and Sequences
- An efficient algorithm for the all pairs suffix-prefix problem
- An extension of the Burrows-Wheeler transform
- An external-memory algorithm for string graph construction
- An improved algorithm for the all-pairs suffix-prefix problem
- Bidirectional variable-order de Bruijn graphs
- Compressed representations of sequences and full-text indexes
- Compressed suffix trees, efficient computation and storage of LCP-values
- Divide and conquer computation of the multi-string BWT and LCP array
- Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
- Engineering a lightweight external memory suffix array construction algorithm
- Fast lightweight suffix array construction and checking
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1947433 (Why is no real title available?)
- Inducing enhanced suffix arrays for string collections
- LCP array construction in external memory
- Lightweight algorithms for constructing and inverting the BWT of string collections
- Lightweight BWT and LCP merging via the gap algorithm
- Lightweight LCP construction for very large collections of strings
- Linear time construction of compressed text indices in compact space
- Space-efficient construction of compressed indexes in deterministic linear time
- Succinct de Bruijn graphs
Cited in
(10)- Divide and conquer computation of the multi-string BWT and LCP array
- Computing the multi-string BWT and LCP array in external memory
- A simple algorithm for computing the document array
- Space efficient merging of de Bruijn graphs and Wheeler graphs
- Lightweight merging of compressed indices based on BWT variants
- The alternating BWT: an algorithmic perspective
- Lightweight LCP construction for very large collections of strings
- Lightweight data indexing and compression in external memory
- Lightweight algorithms for constructing and inverting the BWT of string collections
- Space-efficient merging of succinct de Bruijn graphs
This page was built for publication: External memory BWT and LCP computation for sequence collections with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090335)
