Pages that link to "Item:Q5269285"
From MaRDI portal
The following pages link to Better external memory suffix array construction (Q5269285):
Displaying 12 items.
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (Q1006380) (← links)
- Engineering a lightweight external memory suffix array construction algorithm (Q2363989) (← links)
- Faster average case low memory semi-external construction of the Burrows-Wheeler transform (Q2363991) (← links)
- Lightweight data indexing and compression in external memory (Q2429367) (← links)
- Fast BWT in small space by blockwise suffix sorting (Q2465056) (← links)
- Permuted Longest-Common-Prefix Array (Q3637112) (← links)
- Better External Memory LCP Array Construction (Q4629538) (← links)
- Scalable Parallel Suffix Array Construction (Q4643558) (← links)
- Inducing Suffix and LCP Arrays in External Memory (Q5266606) (← links)
- LCP Array Construction in External Memory (Q5266615) (← links)
- Faster Compressed Suffix Trees for Repetitive Collections (Q5266617) (← links)
