The following pages link to Practical compressed suffix trees (Q1736557):
Displaying 10 items.
- Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- Editorial: Special issue on algorithms for sequence analysis and storage (Q1736610) (← links)
- Compressed range minimum queries (Q2297849) (← links)
- Faster repetition-aware compressed suffix trees based on block trees (Q2672222) (← links)
- Locally Compressed Suffix Arrays (Q2828176) (← links)
- The longest common substring problem (Q2971067) (← links)
- Lazy Lempel-Ziv Factorization Algorithms (Q5266607) (← links)
- Faster Compressed Suffix Trees for Repetitive Collections (Q5266617) (← links)
- Bidirectional Variable-Order de Bruijn Graphs (Q5384620) (← links)
