Integrating long-range connectivity information into de Bruijn graphs.

ABSTRACT: Motivation:The de Bruijn graph is a simple and efficient data structure that is used in many areas of sequence analysis including genome assembly, read error correction and variant calling. The data structure has a single parameter k, is straightforward to implement and is tractable for large genomes with high sequencing depth. It also enables representation of multiple samples simultaneously to facilitate comparison. However, unlike the string graph, a de Bruijn graph does not retain long range information that is inherent in the read data. For this reason, applications that rely on de Bruijn graphs can produce sub-optimal results given their input data. Results:We present a novel assembly graph data structure: the Linked de Bruijn Graph (LdBG). Constructed by adding annotations on top of

SUBMITTER: Turner I 

PROVIDER: S-EPMC6061703 | biostudies-literature | 2018 Aug

REPOSITORIES: biostudies-literature