New Results About the Linearization of Scaffolds Sharing Repeated Contigs
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.
This work was supported by the Institut de Biologie Computationnelle3 (http://www.ibc-montpellier.fr/) (ANR Projet Investissements d’Avenir en bioinformatique IBC) and the “Région Occitanie”.
- 2.Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness and satisfiability of bounded occurrence instances of SAT. Electronic Colloquium on Computational Complexity (ECCC), vol. 10, no. 022 (2003)Google Scholar
- 5.Davot, T., Chateau, A., Giroudeau, R., Weller, M.: On the hardness of approximating the linearization of scaffolds sharing repeated contigs, Accepted to RecombCG 2018Google Scholar
- 9.Mandric, I., Lindsay, J., Măndoiu, I.I., Zelikovsky, A.: Scaffolding algorithms. In: Măndoiu, I., Zelikovsky, A. (eds.) Computational Methods for Next Generation Sequencing Data Analysis, Chap. 5, pp. 107–132. Wiley (2016)Google Scholar