Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Algorithmica Année : 2018

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

Résumé

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 approximability of the scaffolding problem in special classes of graphs, either close to trees, or very dense. We propose negative and positive results, exploring the frontier between difficulty and tractability of computing and/or approximating a solution to the problem. Also, we explore a new direction through related problems consisting in finding a family of edges having a strong effect on solution weight.
Fichier principal
Vignette du fichier
hal_version.pdf (739.79 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01833303 , version 1 (19-07-2018)

Identifiants

Citer

Mathias Weller, Annie Chateau, Clément Dallard, Rodolphe Giroudeau. Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases. Algorithmica, 2018, 80 (6), pp.1771-1803. ⟨10.1007/s00453-018-0405-x⟩. ⟨hal-01833303⟩
217 Consultations
202 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More