Pages that link to "Item:Q1670729"
From MaRDI portal
The following pages link to Divide and conquer computation of the multi-string BWT and LCP array (Q1670729):
Displaying 5 items.
- Computing the multi-string BWT and LCP array in external memory (Q1998862) (← links)
- Space-efficient construction of compressed suffix trees (Q2220837) (← links)
- Space-efficient computation of the LCP array from the Burrows-Wheeler transform (Q5088894) (← links)
- (Q5090335) (← links)
- Lightweight BWT and LCP Merging via the Gap Algorithm (Q5150930) (← links)
