The following pages link to Faster suffix sorting (Q2465058):
Displayed 15 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)
- Suffix-sorting via Shannon-Fano-Elias codes (Q1662548) (← links)
- On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation (Q1944955) (← links)
- Lempel-Ziv-like parsing in small space (Q2205632) (← links)
- An elegant algorithm for the construction of suffix arrays (Q2250537) (← links)
- Parallel lightweight wavelet tree, suffix array and FM-index construction (Q2397146) (← links)
- GAME: A simple and efficient whole genome alignment method using maximal exact match filtering (Q2500318) (← links)
- Space efficient linear time construction of suffix arrays (Q2569393) (← links)
- Optimal in-place suffix sorting (Q2672235) (← links)
- PSAEC: An Improved Algorithm for Short Read Error Correction Using Partial Suffix Arrays (Q3004672) (← links)
- Algorithms for Indexing Highly Similar DNA Sequences (Q3305514) (← links)
- A Fast Suffix-Sorting Algorithm (Q3439227) (← links)
- Space efficient algorithms for the Burrows-Wheeler backtransformation (Q5961973) (← links)
- Parallel suffix sorting for large string analytics (Q6135464) (← links)