The greedy algorithm for the minimum common string partition problem (Q2944502)
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 6477833
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The greedy algorithm for the minimum common string partition problem |
scientific article; zbMATH DE number 6477833 |
Statements
The greedy algorithm for the minimum common string partition problem (English)
0 references
2 September 2015
0 references
string algorithms
0 references
approximation algorithms
0 references
1.0000011920928955
0 references
0.9091136455535888
0 references
0.9006752371788025
0 references
0.8697658181190491
0 references
0.8682212829589844
0 references
