Pages that link to "Item:Q4643558"
From MaRDI portal
The following pages link to Scalable Parallel Suffix Array Construction (Q4643558):
Displaying 9 items.
- Suffix array and Lyndon factorization of a text (Q405567) (← links)
- Extended suffix array construction using Lyndon factors (Q1615410) (← links)
- Efficient chain code compression with interpolative coding (Q2195467) (← links)
- Parallel lightweight wavelet tree, suffix array and FM-index construction (Q2397146) (← links)
- Can Burrows-Wheeler transform be replaced in chain code compression? (Q2663576) (← links)
- Parallel External Memory Suffix Sorting (Q2942270) (← links)
- Scalable Parallel Suffix Array Construction (Q4643558) (← links)
- Scalable Suffix Sorting on a Multicore Machine (Q5126060) (← links)
- On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching (Q5369561) (← links)