An integer linear programming approach for genome scaffolding - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

An integer linear programming approach for genome scaffolding

Résumé

This paper presents a simple and fast approach for genome scaffolding, combining constraint modeling and simple graph manipulation. We model the scaffolding problem as an optimization problem on a graph built from a paired-end reads alignment on contigs, then describe an heuristic to solve this problem with the iterative combination of local constraints solving and cycle breaking phases. We tested our approach on a benchmark of various genomes, and compared it with several usual scaffolders. The proposed method is quick, flexible, and provides results comparable to other scaffolders in terms of quality. In addition, contrarily to state of the art approaches that require dedicated servers, it can be run on a basic notebook computer even for large genomes.
Fichier principal
Vignette du fichier
An integer linear programming approach for genome scaffolding_SDG_{38EC86A4-D09E-4271-AF4D-5096129967C7}.pdf (401.22 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01198359 , version 1 (11-09-2015)

Identifiants

  • HAL Id : hal-01198359 , version 1
  • PRODINRA : 324381

Citer

Nicolas Briot, Annie Chateau, Remi Coletta, Simon de Givry, Philippe Leleux, et al.. An integer linear programming approach for genome scaffolding. WCB: Workshop on Constraint-Based Methods for Bioinformatics, Sep 2014, Lyon, France. 16 p. ⟨hal-01198359⟩
309 Consultations
142 Téléchargements

Partager

Gmail Facebook X LinkedIn More