LCP array construction using \(O(\operatorname{sort}(n))\) (or less) I/Os
From MaRDI portal
Publication:1796848
DOI10.1007/978-3-319-46049-9_20zbMath1397.68034OpenAlexW2522043801MaRDI QIDQ1796848
Juha Kärkkäinen, Dominik Kempa
Publication date: 17 October 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-46049-9_20
Related Items
Extracting the sparse longest common prefix array from the suffix binary search tree, In-place algorithms for exact and approximate shortest unique substring problems, Better External Memory LCP Array Construction, Burrows-Wheeler transform and LCP array construction in constant space, Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies
