Pages that link to "Item:Q2363989"
From MaRDI portal
The following pages link to Engineering a lightweight external memory suffix array construction algorithm (Q2363989):
Displaying 6 items.
- Space efficient merging of de Bruijn graphs and Wheeler graphs (Q2118200) (← links)
- Faster average case low memory semi-external construction of the Burrows-Wheeler transform (Q2363991) (← links)
- Better External Memory LCP Array Construction (Q4629538) (← links)
- (Q5090335) (← links)
- LCP Array Construction in External Memory (Q5266615) (← links)
- Faster Compressed Suffix Trees for Repetitive Collections (Q5266617) (← links)