The following pages link to (Q5708460):
Displaying 30 items.
- Colored range queries and document retrieval (Q390874) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- New algorithms on wavelet trees and applications to information retrieval (Q418727) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- A compressed dynamic self-index for highly repetitive text collections (Q776840) (← links)
- Dynamic extended suffix arrays (Q972366) (← links)
- Sorting streamed multisets (Q975507) (← links)
- Move-to-front, distance coding, and inversion frequencies revisited (Q982665) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- Fixed block compression boosting in FM-indexes: theory and practice (Q1739099) (← links)
- Top tree compression of tries (Q2067669) (← links)
- Adaptive succinctness (Q2118203) (← links)
- r-indexing the eBWT (Q2146118) (← links)
- Space-efficient algorithms for computing minimal/shortest unique substrings (Q2207510) (← links)
- The myriad virtues of wavelet trees (Q2389347) (← links)
- Grammar compressed sequences with rank/select support (Q2397151) (← links)
- Wavelet trees for all (Q2442812) (← links)
- Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree (Q2942273) (← links)
- An Opportunistic Text Indexing Structure Based on Run Length Encoding (Q2947038) (← links)
- Algorithms for Indexing Highly Similar DNA Sequences (Q3305514) (← links)
- Indexing the bijective BWT (Q5088907) (← links)
- (Q5088917) (← links)
- (Q5092429) (← links)
- Constructing and indexing the bijective and extended Burrows-Wheeler transform (Q6204171) (← links)
- Compact data structures for shortest unique substring queries (Q6536247) (← links)
- An index for sequencing reads based on the colored de Bruijn graph (Q6536263) (← links)
- Adaptive succinctness (Q6536273) (← links)
- Constant time and space updates for the sigma-tau problem (Q6545441) (← links)
- On the number of equal-letter runs of the bijective Burrows-Wheeler transform (Q6658309) (← links)
