\boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring (Q4943853)
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 1417074
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring |
scientific article; zbMATH DE number 1417074 |
Statements
\boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring (English)
0 references
19 March 2000
0 references
algorithm
0 references
shortest superstring
0 references
shotgun sequencing
0 references
data compression
0 references
0.94185567
0 references
0 references
0.93058074
0 references
0.92836785
0 references
0.9272649
0 references
0.92674184
0 references
0.92485946
0 references
0.9230479
0 references
