Space-time trade-offs for finding shortest unique substrings and maximal unique matches (Q2410365)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Space-time trade-offs for finding shortest unique substrings and maximal unique matches |
scientific article |
Statements
Space-time trade-offs for finding shortest unique substrings and maximal unique matches (English)
0 references
17 October 2017
0 references
suffix tree
0 references
sparsification
0 references
succinct data structures
0 references
Rabin-Karp fingerprint
0 references
probabilistic z-fast trie
0 references
0 references
0 references
