A work-time optimal algorithm for computing all string covers (Q671438): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 10:21, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A work-time optimal algorithm for computing all string covers |
scientific article |
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