A work-time optimal algorithm for computing all string covers (Q671438): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:56, 5 March 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
