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
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01900389
Contributor : Tom Davot <>
Submitted on : Monday, October 22, 2018 - 9:20:56 AM
Last modification on : Wednesday, April 3, 2019 - 1:58:31 AM
Long-term archiving on : Wednesday, January 23, 2019 - 12:46:45 PM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-01900389, version 1

Citation

Dorine Tabary, Tom Davot, Mathias Weller, Annie Chateau, Rodolphe Giroudeau. New results about the linearization of scaffolds sharing repeated contigs. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2018, Atlanta, United States. ⟨lirmm-01900389v1⟩

Share

Metrics

Record views

370

Files downloads

53