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.
CITATION STYLE
Tabary, D., Davot, T., Weller, M., Chateau, A., & Giroudeau, R. (2018). New results about the linearization of scaffolds sharing repeated contigs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11346 LNCS, pp. 94–107). Springer Verlag. https://doi.org/10.1007/978-3-030-04651-4_7
Mendeley helps you to discover research relevant for your work.