The following pages link to (Q4472515):
Displaying 12 items.
- Compressed data structures for strings. On searching and extracting strings from compressed textual data (Q383835) (← links)
- Cross-document pattern matching (Q396714) (← links)
- Indexing text using the Ziv--Lempel trie (Q876708) (← links)
- Counting suffix arrays and strings (Q932319) (← links)
- Extended suffix array construction using Lyndon factors (Q1615410) (← links)
- On-line construction of compact directed acyclic word graphs (Q1764897) (← links)
- Time-space trade-offs for compressed suffix arrays. (Q1853020) (← links)
- Top tree compression of tries (Q2067669) (← links)
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching (Q2220859) (← links)
- Improved and extended locating functionality on compressed suffix arrays (Q2343300) (← links)
- Locally compressed suffix arrays (Q2828176) (← links)
- An experimental study of a compressed index (Q5944434) (← links)