Article

Minimizer-space de Bruijn graphs

2021-06-10

Abstract excerpt

DNA sequencing data continues to progress towards longer reads with increasingly lower sequencing error rates. We focus on the problem of assembling such reads into genomes, which poses challenges in terms of accuracy and computational resources when using cutting-edge assembly approaches, e.g. those based on overlapping reads using minimizer sketches. Here, we introduce the concept of minimizer-space sequencing...

Topics

Open a Topic to create a Post that cites this publication.

Identifiers and source

Literature Corpus work: 0a181c71-24b5-5dda-9afb-a282a7ec3b39
DOI: 10.1101/2021.06.09.447586

Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 12 closest

Minimizer-space de Bruijn graphsDOI 10.1101/2021.06.09.447586Read

ntJoin: Fast and lightweight assembly-guided scaffolding using minimizer graphsSemantic proximity Read

Weighted minimizer sampling improves long read mappingSemantic proximity Read

Sequence-specific minimizers via polar setsSemantic proximity Read

Lossless Indexing with Counting de Bruijn GraphsSemantic proximity Read

Scalable computation of ultrabubbles in pangenomes by orienting bidirected graphsSemantic proximity Read

BubbleGun: Enumerating Bubbles and Superbubbles in Genome GraphsSemantic proximity Read

Cuttlefish: Fast, parallel, and low-memory compaction of de Bruijn graphs from large-scale genome collectionsSemantic proximity Read

Design of Worst-Case-Optimal Spaced SeedsSemantic proximity Read

Fast and sensitive mapping of nanopore sequencing reads with GraphMap.Semantic proximity Read

Pangenome-based genome inference using integer programming.Semantic proximity Read

Integer programming framework for pangenome-based genome inferenceSemantic proximity Read

Theory of local k-mer selection with applications to long-read alignment.Semantic proximity Read