Space-Time Trade-Offs for the Shortest Unique Substring Problem. (Q4636517)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Space-Time Trade-Offs for the Shortest Unique Substring Problem. |
scientific article; zbMATH DE number 6861967
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Space-Time Trade-Offs for the Shortest Unique Substring Problem. |
scientific article; zbMATH DE number 6861967 |
Statements
19 April 2018
0 references
suffix tree
0 references
sparsification
0 references
Rabin-Karp fingerprint
0 references
probabilistic \(z\)-fast trie
0 references
succinct data structures
0 references
Space-Time Trade-Offs for the Shortest Unique Substring Problem. (English)
0 references
