Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1025966 |
||
| Property / author | |||
| Property / author: Q964403 / rank | |||
Revision as of 00:31, 22 February 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
