Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566): Difference between revisions
From MaRDI portal
Latest revision as of 12:40, 6 July 2024
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