The following pages link to The compressed permuterm index (Q3188992):
Displaying 11 items.
- Space-efficient substring occurrence estimation (Q261345) (← links)
- Compressed string dictionary search with edit distance one (Q270017) (← links)
- Indexing permutations for binary strings (Q407548) (← links)
- On optimally partitioning a text to improve its compression (Q634677) (← links)
- Lempel-Ziv-78 compressed string dictionaries (Q724216) (← links)
- Wheeler graphs: a framework for BWT-based data structures (Q1676308) (← links)
- Space efficient merging of de Bruijn graphs and Wheeler graphs (Q2118200) (← links)
- On the complexity of recognizing Wheeler graphs (Q2118211) (← links)
- Lightweight merging of compressed indices based on BWT variants (Q2297864) (← links)
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs (Q5075794) (← links)
- A new class of string transformations for compressed text indexing (Q6053405) (← links)