Global Optimization for Scafolding and Completing Genome Assemblies - Archive ouverte HAL Access content directly
Conference Papers Year :

Global Optimization for Scafolding and Completing Genome Assemblies

(1) , (1) , (1) , (2)
1
2

Abstract

We develop a method for solving genome scafolding as a problem of finding a long simple path in a graph defined by the contigs that satisfies additional constraints encoding the insert-size information. Then we solve the resulting mixed integer linear program to optimality using the Gurobi solver. We test our algorithm on several chloroplast genomes and show that it outperforms other widely-used assembly solvers by the accuracy of the results.
Fichier principal
Vignette du fichier
inoc_17.pdf (417.93 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01567134 , version 1 (21-07-2017)

Identifiers

  • HAL Id : hal-01567134 , version 1

Cite

Sebastien François, Rumen Andonov, Dominique Lavenier, Hristo Djidjev. Global Optimization for Scafolding and Completing Genome Assemblies . 12th International Workshop on Constraint-Based Methods for Bioinformatics, Sep 2016, Toulouse, France. ⟨hal-01567134⟩
133 View
71 Download

Share

Gmail Facebook Twitter LinkedIn More