Pages that link to "Item:Q3506950"
From MaRDI portal
The following pages link to An(other) Entropy-Bounded Compressed Suffix Tree (Q3506950):
Displaying 7 items.
- Finding range minima in the middle: approximations and applications (Q626956) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- Extended suffix array construction using Lyndon factors (Q1615410) (← links)
- Approximate string matching with compressed indexes (Q1662494) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- Permuted Longest-Common-Prefix Array (Q3637112) (← links)