Approximating Shortest Superstrings (Q4337677): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:45, 6 February 2024
scientific article; zbMATH DE number 1012911
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating Shortest Superstrings |
scientific article; zbMATH DE number 1012911 |
Statements
Approximating Shortest Superstrings (English)
0 references
26 May 1997
0 references
approximation algorithms
0 references
combinatorial optimization
0 references
DNA sequencing
0 references
data compression
0 references
optimal assignments
0 references
the shortest-superstring problem
0 references
