Pages that link to "Item:Q2465056"
From MaRDI portal
The following pages link to Fast BWT in small space by blockwise suffix sorting (Q2465056):
Displaying 14 items.
- Lightweight algorithms for constructing and inverting the BWT of string collections (Q390898) (← links)
- Binary block order Rouen transform (Q507387) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- A four-stage algorithm for updating a Burrows-Wheeler transform (Q732025) (← links)
- Space-efficient construction of compressed suffix trees (Q2220837) (← links)
- Parallel computation of the Burrows Wheeler transform in compact space (Q2297855) (← links)
- Computing the Burrows-Wheeler transform in place and in small space (Q2343299) (← links)
- Engineering a lightweight external memory suffix array construction algorithm (Q2363989) (← links)
- Lightweight data indexing and compression in external memory (Q2429367) (← links)
- A bijective variant of the Burrows-Wheeler transform using \(V\)-order (Q2441784) (← links)
- Faster semi-external suffix sorting (Q2445902) (← links)
- Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis (Q2942244) (← links)
- Arithmetics on Suffix Arrays of Fibonacci Words (Q3449364) (← links)
- Permuted Longest-Common-Prefix Array (Q3637112) (← links)
