Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566)
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 Superstring Problem Using de Bruijn Graphs |
scientific article; zbMATH DE number 6176329
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating Shortest Superstring Problem Using de Bruijn Graphs |
scientific article; zbMATH DE number 6176329 |
Statements
Approximating Shortest Superstring Problem Using de Bruijn Graphs (English)
0 references
14 June 2013
0 references
0 references
