The following pages link to When indexing equals compression (Q2944533):
Displaying 13 items.
- Rank/select on dynamic compressed sequences and applications (Q732036) (← links)
- Improved parallel construction of wavelet trees and rank/select structures (Q776833) (← links)
- Move-to-front, distance coding, and inversion frequencies revisited (Q982665) (← links)
- Computation of the suffix array, Burrows-Wheeler transform and FM-index in \(V\)-order (Q2043023) (← links)
- Adaptive succinctness (Q2118203) (← links)
- Comparison between text compression algorithms in biological sequences (Q2288216) (← links)
- The myriad virtues of wavelet trees (Q2389347) (← links)
- Rank and select revisited and extended (Q2465064) (← links)
- Indexing a sequence for mapping reads with a single mismatch (Q2955639) (← links)
- (Q5088915) (← links)
- On Undetected Redundancy in the Burrows-Wheeler Transform (Q5140764) (← links)
- (Q5501319) (← links)
- Adaptive succinctness (Q6536273) (← links)