Approximating Shortest Superstrings (Q4337677)
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: Approximating Shortest Superstrings |
scientific article; zbMATH DE number 1012911
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9399449229240416
0 references
0.937886118888855
0 references
0.9274308681488036
0 references
0.9184290766716005
0 references
