The shortest common superstring problem: average case analysis for both exact and approximate matching (Q4503372)
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 1503189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The shortest common superstring problem: average case analysis for both exact and approximate matching |
scientific article; zbMATH DE number 1503189 |
Statements
The shortest common superstring problem: average case analysis for both exact and approximate matching (English)
0 references
7 September 2000
0 references
shortest common superstring problem
0 references
0.876776397228241
0 references
0.8751709461212158
0 references
0.8747942447662354
0 references
0.8679184317588806
0 references
0.8665575385093689
0 references
