A complexity and approximation framework for the maximization scaffolding problem

We explore in this paper some complexity issues inspired by the contig scaffolding problem in bioinformatics. We focus on the following problem: given an undirected graph with no loop, and a perfect matching on this graph, find a set of cycles and paths covering every vertex of the graph, with edges...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 595; s. 92 - 106
Hlavní autoři: Chateau, A., Giroudeau, R.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 30.08.2015
Elsevier
Témata:
Bioinformatics
Complexity
Computational Complexity
Computer Science
Data Structures and Algorithms
Polynomial-time approximation algorithm
Scaffolding
Scaffolding
Polynomial-time approximation algorithm
Complexity
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We explore in this paper some complexity issues inspired by the contig scaffolding problem in bioinformatics. We focus on the following problem: given an undirected graph with no loop, and a perfect matching on this graph, find a set of cycles and paths covering every vertex of the graph, with edges alternatively in the matching and outside the matching, and satisfying a given constraint on the numbers of cycles and paths. We show that this problem is NP-complete, even in planar bipartite graphs. Moreover, we show that there is no subexponential-time algorithm for several related problems unless the Exponential-Time Hypothesis fails. Lastly, we also design two polynomial-time approximation algorithms for complete graphs.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2015.06.023