Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem

Annie Chateau 1 Rodolphe Giroudeau 2
1 MAB - Méthodes et Algorithmes pour la Bioinformatique
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
2 MAORE - Méthodes Algorithmes pour l'Ordonnancement et les Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : 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 alternatively in the matching and outside the matching, and satisfying a given constraint on the numbers of cycles and paths. We show that this problem is NP-complete, even in bipartite graphs. We also exhibit non-approximability and polynomial-time approximation results, in the optimization versions of the problem.
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01007556
Contributor : Annie Chateau <>
Submitted on : Monday, June 16, 2014 - 6:26:47 PM
Last modification on : Friday, March 15, 2019 - 5:02:19 PM

Identifiers

Collections

Citation

Annie Chateau, Rodolphe Giroudeau. Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem. AlCoB: Algorithms for Computational Biology, Jul 2014, Tarragona, Spain. pp.47-58, ⟨10.1007/978-3-319-07953-0_4⟩. ⟨lirmm-01007556⟩

Share

Metrics

Record views

206