Global Optimization for Scafolding and Completing Genome Assemblies - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Global Optimization for Scafolding and Completing Genome Assemblies

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-01567134 , version 1

Citer

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⟩
135 Consultations
76 Téléchargements

Partager

Gmail Facebook X LinkedIn More