Linking indexing data structures to de Bruijn graphs: Construction and update - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Journal of Computer and System Sciences Year : 2019

Linking indexing data structures to de Bruijn graphs: Construction and update

Abstract

DNA sequencing technologies have tremendously increased their throughput, and hence complicated DNA assembly. Numerous assembly programs use de Bruijn graphs (dBG) built from short reads to merge these into contigs, which represent putative DNA segments. In a dBG of order k, nodes are substrings of length k of reads (or k-mers), while arcs are their k + 1-mers. As analysing reads often require to index all their substrings, it is interesting to exhibit algorithms that directly build a dBG from a pre-existing index, and especially a contracted dBG, where non-branching paths are condensed into single nodes. Here, we exhibit linear time algorithms for constructing the full or contracted dBGs from suffix trees, suffix arrays, and truncated suffix trees. With the latter the construction uses a space that is linear in the size of the dBG. Finally, we also provide algorithms to dynamically update the order of the graph without reconstructing it.
Fichier principal
Vignette du fichier
Cazaux-etal-JCSS-16-temp.pdf (1.12 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-01617207 , version 1 (16-10-2017)

Identifiers

Cite

Bastien Cazaux, Thierry Lecroq, Eric Rivals. Linking indexing data structures to de Bruijn graphs: Construction and update. Journal of Computer and System Sciences, 2019, 104, pp.165-183. ⟨10.1016/j.jcss.2016.06.008⟩. ⟨lirmm-01617207⟩
249 View
211 Download

Altmetric

Share

Gmail Facebook X LinkedIn More