Fast and Practical Algorithms for Computing All the Runs in a String (Q3506932): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-73437-6_31 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1593730394 / rank | |||
Normal rank | |||
Latest revision as of 20:31, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast and Practical Algorithms for Computing All the Runs in a String |
scientific article |
Statements
Fast and Practical Algorithms for Computing All the Runs in a String (English)
0 references
17 June 2008
0 references
