Cargando…
De Bruijn Superwalk with Multiplicities Problem is NP-hard
De Bruijn Superwalk with Multiplicities Problem is the problem of finding a walk in the de Bruijn graph containing several walks as subwalks and passing through each edge the exactly predefined number of times (equal to the multiplicity of this edge). This problem has been stated in the talk by Paul...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2013
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3622630/ https://www.ncbi.nlm.nih.gov/pubmed/23734822 http://dx.doi.org/10.1186/1471-2105-14-S5-S7 |