Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases

This paper is devoted to new results about the scaffolding problem, an integral problem of genome inference in bioinformatics. The problem consists in finding a collection of disjoint cycles and paths covering a particular graph called the “scaffold graph”. We examine the difficulty and the approxim...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica Jg. 80; H. 6; S. 1771 - 1803
Hauptverfasser:	Weller, Mathias, Chateau, Annie, Dallard, Clément, Giroudeau, Rodolphe
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.06.2018 Springer Nature B.V Springer Verlag
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Bioinformatics Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Scaffolding Theory of Computation Lower bound Approximation Scaffolding Kernel Complexity
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!