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

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 595; pp. 92 - 106
Main Authors:	Chateau, A., Giroudeau, R.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 30.08.2015 Elsevier
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!