Computing minimal unique substrings for a sliding window (Q2118202)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7495491
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing minimal unique substrings for a sliding window |
scientific article; zbMATH DE number 7495491 |
Statements
Computing minimal unique substrings for a sliding window (English)
0 references
22 March 2022
0 references
minimal unique substring
0 references
sliding window
0 references
suffix tree
0 references
0 references
0 references
0.9300318956375122
0 references
0.8018498420715332
0 references
0.7925625443458557
0 references
0.7660279273986816
0 references
0.7619106769561768
0 references
