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

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 595; s. 92 - 106
Hlavní autori:	Chateau, A., Giroudeau, R.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 30.08.2015 Elsevier
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!