A work-time optimal algorithm for computing all string covers (Q671438)
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 983302
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A work-time optimal algorithm for computing all string covers |
scientific article; zbMATH DE number 983302 |
Statements
A work-time optimal algorithm for computing all string covers (English)
0 references
27 February 1997
0 references
repetitive structures of strings
0 references
0 references
0.8745774030685425
0 references
0.8347179889678955
0 references
0.8306407332420349
0 references
