Quick greedy computation for minimum common string partition (Q2015138)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Quick greedy computation for minimum common string partition |
scientific article; zbMATH DE number 6306359
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quick greedy computation for minimum common string partition |
scientific article; zbMATH DE number 6306359 |
Statements
Quick greedy computation for minimum common string partition (English)
0 references
23 June 2014
0 references
strings
0 references
approximation algorithm
0 references
pattern matching
0 references
0 references
0 references
0.9949073791503906
0 references
0.9091136455535888
0 references
0.909113347530365
0 references
0.8282351493835449
0 references
0.8264559507369995
0 references
