The following pages link to Fully-Compressed Suffix Trees (Q5458543):
Displaying 9 items.
- Space-efficient substring occurrence estimation (Q261345) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- Combined data structure for previous- and next-smaller-values (Q533896) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- Dynamic extended suffix arrays (Q972366) (← links)
- Wee LCP (Q991794) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- Approximate string matching with compressed indexes (Q1662494) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
