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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 595; S. 92 - 106
Hauptverfasser:	Chateau, A., Giroudeau, R.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 30.08.2015 Elsevier
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!