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 …
genome inference in bioinformatics. The problem consists in finding a collection of disjoint …
Instance guaranteed ratio on greedy heuristic for genome scaffolding
The Scaffolding problem in bioinformatics, aims to complete the contig assembly process by
determining the relative position and orientation of these contigs. Modeled as a …
determining the relative position and orientation of these contigs. Modeled as a …
On residual approximation in solution extension problems
The solution extension variant of a problem consists in, being given an instance and a
partial solution, finding the best solution comprising the given partial solution. Many …
partial solution, finding the best solution comprising the given partial solution. Many …
Better approximation algorithms for scaffolding problems
ZZ Chen, Y Harada, E Machida, F Guo… - International Workshop on …, 2016 - Springer
Scaffolding is one of the main stages in genome assembly. During this stage, we want to
merge contigs assembled from the paired-end reads into bigger chains called scaffolds. For …
merge contigs assembled from the paired-end reads into bigger chains called scaffolds. For …
On a greedy approach for genome scaffolding
Background Scaffolding is a bioinformatics problem aimed at completing the contig
assembly process by determining the relative position and orientation of these contigs. It can …
assembly process by determining the relative position and orientation of these contigs. It can …
Approximation algorithms for the scaffolding problem and its generalizations
ZZ Chen, Y Harada, F Guo, L Wang - Theoretical Computer Science, 2018 - Elsevier
Scaffolding is one of the main stages in genome assembly. During this stage, we want to
merge contigs assembled from the paired-end reads into bigger chains called scaffolds. For …
merge contigs assembled from the paired-end reads into bigger chains called scaffolds. For …
New polynomial-time algorithm around the scaffolding problem
We describe in this paper an approximation algorithm for the scaffolding problem, which is
part of genome inference in bioinformatics. The aim of the problem is to find a maximum …
part of genome inference in bioinformatics. The aim of the problem is to find a maximum …
[PDF][PDF] Mémoire de fin d'étude
Résumé La production de séquences génomiques nécessite plusieurs traitements
informatiques qui doivent manipuler de grandes quantités de données en un temps …
informatiques qui doivent manipuler de grandes quantités de données en un temps …
New Polynomial-Time Algorithm Around the Scaffolding Problem
M Weller - Algorithms for Computational Biology - Springer
We describe in this paper an approximation algorithm for the scaffolding problem, which is
part of genome inference in bioinformatics. The aim of the problem is to find a maximum …
part of genome inference in bioinformatics. The aim of the problem is to find a maximum …
[PDF][PDF] A la recherche de l'échafaudage parfait: efficace, de qualité, et garanti
ACR Giroudeau - lirmm.fr
Les masses de données de séquençage posent aujourd'hui des défis sensibles au niveau
de la production des génomes. Il s' agit de déterminer des méthodes efficaces et rapides de …
de la production des génomes. Il s' agit de déterminer des méthodes efficaces et rapides de …