Global Optimization Methods for Genome Scaffolding - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Global Optimization Methods for Genome Scaffolding

Abstract

We develop a method for solving genome scaffolding 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 is fast and outperforms other widely-used assembly algorithms by the accuracy of the results.
Fichier principal
Vignette du fichier
WCB16_paper_6.pdf (734.37 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01385665 , version 1 (21-10-2016)

Identifiers

  • HAL Id : hal-01385665 , version 1

Cite

Sebastien François, Rumen Andonov, Hristo Djidjev, Dominique Lavenier. Global Optimization Methods for Genome Scaffolding. 12th International Workshop on Constraint-Based Methods for Bioinformatics , Sep 2016, Toulouse, France. ⟨hal-01385665⟩
368 View
193 Download

Share

Gmail Facebook Twitter LinkedIn More