Skip to Main content Skip to Navigation
Poster communications

Debugging long-read genome and metagenome assemblies using string graph analysis

Pierre Marijon 1 Jean-Stéphane Varré 1 Rayan Chikhi 1
1 BONSAI - Bioinformatics and Sequence Analysis
CNRS - Centre National de la Recherche Scientifique, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189, Inria Lille - Nord Europe, Université de Lille, Sciences et Technologies
Abstract : Third-generation long-read sequencing technologies tackle the repeat problem in genome assembly by producing reads that are long enough to span most repeat instances. In principle one expects that with such reads most bacterial genomes will be assembled into a single contig. However in practice, some datasets fail to be perfectly assembled even with leading assemblers, and are fragmented into a handful of contigs. As a mean to investigate those cases, we consider the string graphs that are generated by assemblers during intermediate stages of the assembly process. We seek to establish a coherent framework for analyzing these graphs, in the hope that they will help us determine the biological causes that led the assembler to output shorter contigs. This poster presents some preliminary results of such an analysis.
Document type :
Poster communications
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download

https://hal.inria.fr/hal-01574824
Contributor : Jean-Stéphane Varré <>
Submitted on : Wednesday, August 16, 2017 - 4:04:33 PM
Last modification on : Friday, January 8, 2021 - 3:14:06 PM

File

jobim_poster-demo.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01574824, version 1

Citation

Pierre Marijon, Jean-Stéphane Varré, Rayan Chikhi. Debugging long-read genome and metagenome assemblies using string graph analysis. JOBIM 2017- Journées Ouvertes en Biologie, Informatique et Mathématiques, Jul 2017, Lille, France. ⟨hal-01574824⟩

Share

Metrics

Record views

1037

Files downloads

290