Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 18:04, 5 March 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
