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

Celý popis

Podrobná bibliografie

Vydáno v:	Algorithmica Ročník 80; číslo 6; s. 1771 - 1803
Hlavní autoři:	Weller, Mathias, Chateau, Annie, Dallard, Clément, Giroudeau, Rodolphe
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.06.2018 Springer Nature B.V Springer Verlag
Témata:	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
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!