Pages that link to "Item:Q2429367"
From MaRDI portal
The following pages link to Lightweight data indexing and compression in external memory (Q2429367):
Displaying 17 items.
- Suffix array and Lyndon factorization of a text (Q405567) (← links)
- Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
- Extended suffix array construction using Lyndon factors (Q1615410) (← links)
- Computing the multi-string BWT and LCP array in external memory (Q1998862) (← 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)
- Parallel algorithms for Burrows-Wheeler compression and decompression (Q2437742) (← links)
- Faster semi-external suffix sorting (Q2445902) (← links)
- Optimal in-place suffix sorting (Q2672235) (← links)
- Full-Text Indexes for High-Throughput Sequencing (Q3305517) (← links)
- On the Value of Multiple Read/Write Streams for Data Compression (Q3637105) (← links)
- Bidirectional Text Compression in External Memory (Q5075783) (← links)
- Prefix-Free Parsing for Building Big BWTs (Q5090326) (← 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)
- The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words (Q5326383) (← links)
