Solutions to genome scaffolding problems can be represented as paths and cycles in a “solution graph”. However, when working with repetitions, such solution graph may contain branchings and they may not be uniquely convertible into sequences. Having introduced, in a previous work, 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 the APX-completeness in this case. We also provide some practical tests.
CITATION STYLE
Davot, T., Chateau, A., Giroudeau, R., & Weller, M. (2018). On the hardness of approximating 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. 11183 LNBI, pp. 91–107). Springer Verlag. https://doi.org/10.1007/978-3-030-00834-5_5
Mendeley helps you to discover research relevant for your work.