New results about the linearization of scaffolds sharing repeated contigs

Abstract : 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.
Document type :
Conference papers
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01900389
Contributor : Tom Davot <>
Submitted on : Friday, March 29, 2019 - 4:35:42 PM
Last modification on : Wednesday, April 3, 2019 - 1:58:31 AM

File

cocoa_2018_new_results_about__...
Files produced by the author(s)

Identifiers

Collections

Citation

Dorine Tabary, Tom Davot, Mathias Weller, Annie Chateau, Rodolphe Giroudeau. New results about the linearization of scaffolds sharing repeated contigs. COOA: Conference on Combinatorial Optimization and Applications, Sep 2018, Atlanta, GA, United States. pp.94-107, ⟨10.1007/978-3-030-04651-4_7⟩. ⟨lirmm-01900389v2⟩

Share

Metrics

Record views

13

Files downloads

8