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 |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8533530235290527
0 references
0.8532312512397766
0 references
0.8510735630989075
0 references
0.8442594408988953
0 references
0.8411117792129517
0 references
