Faster External Memory LCP Array Construction
From MaRDI portal
Publication:4606333
DOI10.4230/LIPICS.ESA.2016.61zbMATH Open1397.68033OpenAlexW2575398296MaRDI QIDQ4606333FDOQ4606333
Authors: Juha Kärkkäinen, Dominik Kempa 
Publication date: 2 March 2018
Full work available at URL: https://dx.doi.org/10.4230/LIPIcs.ESA.2016.61
Recommendations
- Better external memory LCP array construction
- LCP array construction in external memory
- External memory generalized suffix and LCP arrays construction
- Engineering external memory LCP array construction: parallel, in-place and large alphabet
- Better external memory suffix array construction
- Inducing suffix and LCP arrays in external memory
- Inducing suffix and LCP arrays in external memory
- Fast and Lightweight LCP-Array Construction Algorithms
- Engineering a lightweight external memory suffix array construction algorithm
Cited In (13)
- 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
- Faster semi-external suffix sorting
- LCP array construction in external memory
- 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
- Better external memory LCP array construction
- Fast and Lightweight LCP-Array Construction Algorithms
- Space-efficient parallel construction of succinct representations of suffix tree topologies
- Burrows-Wheeler transform and LCP array construction in constant space
This page was built for publication: Faster External Memory LCP Array Construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606333)
