A simple yet time-optimal and linear-space algorithm for shortest unique substring queries (Q476914)
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: A simple yet time-optimal and linear-space algorithm for shortest unique substring queries |
scientific article; zbMATH DE number 6376006
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple yet time-optimal and linear-space algorithm for shortest unique substring queries |
scientific article; zbMATH DE number 6376006 |
Statements
A simple yet time-optimal and linear-space algorithm for shortest unique substring queries (English)
0 references
2 December 2014
0 references
unique substring
0 references
shortest unique substring
0 references
repetitiveness
0 references
regularity
0 references
0.9657548069953918
0 references
0.9017197489738464
0 references
0.8975440859794617
0 references
0.8768366575241089
0 references
0.8728945851325989
0 references
