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 12 items.
- Engineering a lightweight suffix array construction algorithm (Q1882475) (← links)
- 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)
- Faster semi-external suffix sorting (Q2445902) (← links)
- Fast Lightweight Suffix Array Construction and Checking (Q3550827) (← links)
- Faster External Memory LCP Array Construction (Q4606333) (← links)
- Better External Memory LCP Array Construction (Q4629538) (← links)
- (Q5090335) (← links)
- Engineering External Memory Induced Suffix Sorting (Q5232567) (← links)
- LCP Array Construction in External Memory (Q5266615) (← links)
- Faster Compressed Suffix Trees for Repetitive Collections (Q5266617) (← links)
- A theoretical and experimental study on the construction of suffix arrays in external memory (Q5956830) (← links)