A work-time optimal algorithm for computing all string covers (Q671438): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(96)00047-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992597116 / rank | |||
Normal rank | |||
Revision as of 01:24, 20 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
