\boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring (Q4943853): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:56, 8 February 2024
scientific article; zbMATH DE number 1417074
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
