Compact data structures for shortest unique substring queries (Q6536247)
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 7834803
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Compact data structures for shortest unique substring queries |
scientific article; zbMATH DE number 7834803 |
Statements
Compact data structures for shortest unique substring queries (English)
0 references
19 April 2024
0 references
string processing algorithm
0 references
shortest unique substring
0 references
compact data structure
0 references
0 references
0 references
0.9408093094825744
0 references
0.9235207438468932
0 references
0.9006965756416321
0 references
0.8990612626075745
0 references
0.8823602199554443
0 references
