Better external memory LCP array construction
From MaRDI portal
Recommendations
- Faster External Memory LCP Array Construction
- LCP array construction in external memory
- Engineering external memory LCP array construction: parallel, in-place and large alphabet
- LCP array construction using \(O(\operatorname{sort}(n))\) (or less) I/Os
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
Cites work
- scientific article; zbMATH DE number 1998345 (Why is no real title available?)
- scientific article; zbMATH DE number 2038766 (Why is no real title available?)
- scientific article; zbMATH DE number 1786458 (Why is no real title available?)
- scientific article; zbMATH DE number 2119665 (Why is no real title available?)
- Algorithm Theory - SWAT 2004
- Algorithms and data structures for external memory
- Better external memory suffix array construction
- Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction
- Compressed representations of sequences and full-text indexes
- Computing the longest common prefix array based on the Burrows-Wheeler transform
- Engineering External Memory Induced Suffix Sorting
- Engineering a lightweight external memory suffix array construction algorithm
- Engineering external memory LCP array construction: parallel, in-place and large alphabet
- External memory generalized suffix and LCP arrays construction
- Fast and Lightweight LCP-Array Construction Algorithms
- Faster External Memory LCP Array Construction
- Foundations of software technology and theoretical computer science. 16th conference, Hyderabad, India, December 18--20, 1996. Proceedings
- Inducing suffix and LCP arrays in external memory
- LCP array construction in external memory
- LCP array construction using \(O(\operatorname{sort}(n))\) (or less) I/Os
- Lightweight LCP Construction for Next-Generation Sequencing Datasets
- Low space external memory construction of the succinct permuted longest common prefix array
- Parallel External Memory Suffix Sorting
- Permuted Longest-Common-Prefix Array
- Practical entropy-compressed rank/select dictionary
- Replacing suffix trees with enhanced suffix arrays
- Sampled Longest Common Prefix Array
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
- Suffix Arrays: A New Method for On-Line String Searches
- Tighter bounds for the sum of irreducible LCP values
Cited in
(17)- Computing the multi-string BWT and LCP array in external memory
- LCP array construction using \(O(\operatorname{sort}(n))\) (or less) I/Os
- Low space external memory construction of the succinct permuted longest common prefix array
- Better external memory suffix array construction
- Inducing suffix and LCP arrays in external memory
- LCP array construction in external memory
- External memory BWT and LCP computation for sequence collections with applications
- Engineering a lightweight external memory suffix array construction algorithm
- External memory generalized suffix and LCP arrays construction
- Inducing suffix and LCP arrays in external memory
- Engineering external memory LCP array construction: parallel, in-place and large alphabet
- Lightweight LCP construction for very large collections of strings
- Optimal suffix sorting and LCP array construction for constant alphabets
- Faster External Memory LCP Array Construction
- Fast, parallel, and cache-friendly suffix array construction
- Inducing the LCP-array
- Inducing enhanced suffix arrays for string collections
This page was built for publication: Better external memory LCP array construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629538)
