Fast and Practical Algorithms for Computing All the Runs in a String (Q3506932)
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 5289262
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast and Practical Algorithms for Computing All the Runs in a String |
scientific article; zbMATH DE number 5289262 |
Statements
Fast and Practical Algorithms for Computing All the Runs in a String (English)
0 references
17 June 2008
0 references
0.8886284828186035
0 references
0.880183219909668
0 references
0.8730769753456116
0 references
0.8713457584381104
0 references
0.8691319823265076
0 references
