Lataa...
ScaffoldScaffolder: solving contig orientation via bidirected to directed graph reduction
Motivation: The contig orientation problem, which we formally define as the MAX-DIR problem, has at times been addressed cursorily and at times using various heuristics. In setting forth a linear-time reduction from the MAX-CUT problem to the MAX-DIR problem, we prove the latter is NP-complete. We c...
Tallennettuna:
| Julkaisussa: | Bioinformatics |
|---|---|
| Päätekijät: | , , , , |
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
Oxford University Press
2016
|
| Aiheet: | |
| Linkit: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5006237/ https://ncbi.nlm.nih.gov/pubmed/26382194 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1093/bioinformatics/btv548 |
| Tagit: |
Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!
|