New results about the linearization of scaffolds sharing repeated contigs
Résumé
Solutions to genome scaffolding problems can be represented as paths and cycles in a "solution graph". However, when working with repetitions, such solution graphs may contain branchings and, thus, they may not be uniquely convertible into sequences. Having introduced various ways of extracting the unique parts of such solutions, we extend previously known NP-hardness results to the case that the solution graph is planar, bipartite, and subcubic, and show that there is no PTAS in this case.
Domaines
Bio-informatique [q-bio.QM]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...