Pages that link to "Item:Q1796848"
From MaRDI portal
The following pages link to LCP array construction using \(O(\operatorname{sort}(n))\) (or less) I/Os (Q1796848):
Displayed 5 items.
- Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
- Extracting the sparse longest common prefix array from the suffix binary search tree (Q2146135) (← links)
- In-place algorithms for exact and approximate shortest unique substring problems (Q2399613) (← links)
- Better External Memory LCP Array Construction (Q4629538) (← links)
- Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies (Q5270943) (← links)