BlastGraph: intensive approximate pattern matching in string graphs and de-Bruijn graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

BlastGraph: intensive approximate pattern matching in string graphs and de-Bruijn graphs

Abstract

Abstract. Many de novo assembly tools have been created these last few years to assemble short reads generated by high throughput sequencing platforms. The core of almost all these assemblers is a string graph data structure that links reads together. This motivates our work: BlastGraph, a new algorithm performing intensive approximate string matching between a set of query sequences and a string graph. Our approach is similar to blast-like algorithms and additionally presents specificity due to the matching on the graph data structure. Our results show that BlastGraph performances permit its usage on large graphs in reasonable time. We propose a Cytoscape plug-in for visualizing results as well as a command line program. These programs are available at http://alcovna.genouest.org/blastree/.
Fichier principal
Vignette du fichier
blast_graph_reviewed.pdf (1.25 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00711911 , version 1 (26-06-2012)

Identifiers

  • HAL Id : hal-00711911 , version 1

Cite

Guillaume Holley, Pierre Peterlongo. BlastGraph: intensive approximate pattern matching in string graphs and de-Bruijn graphs. PSC 2012, Aug 2012, Prague, Czech Republic. ⟨hal-00711911⟩
452 View
352 Download

Share

Gmail Facebook X LinkedIn More