Article

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

2020-10-22

Abstract excerpt

<h4>Motivation</h4> The construction of the compacted de Bruijn graph from collections of reference genomes is a task of increasing interest in genomic analyses. These graphs are increasingly used as sequence indices for short and long read alignment. Also, as we sequence and assemble a greater diversity of genomes, the colored compacted de Bruijn graph is being used as the basis for efficient methods to perform...

Topics

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

Identifiers and source

Literature Corpus work: 4a983f3b-adc8-5085-a9ee-f7c923de567a
DOI: 10.1101/2020.10.21.349605

Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 12 closest

Cuttlefish: Fast, parallel, and low-memory compaction of de Bruijn graphs from large-scale genome collectionsDOI 10.1101/2020.10.21.349605Read

BubbleGun: Enumerating Bubbles and Superbubbles in Genome GraphsSemantic proximity Read

Minimizer-space de Bruijn graphsSemantic proximity Read

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

A run-length-compressed skiplist data structure for dynamic GBWTs supports time and space efficient pangenome operations over syncmersSemantic proximity Read

Toward perfect reads: short reads correction via mapping on compacted de Bruijn graphsSemantic proximity Read

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

Billi: Provably Accurate and Scalable Bubble Detection in Pangenome GraphsSemantic proximity Read

Cluster efficient pangenome graph construction with nf-core/pangenomeSemantic proximity Read

Efficient indexing and querying of annotations in a pangenome graphSemantic proximity Read

GIN-TONIC: Non-hierarchical full-text indexing for graph-genomesSemantic proximity Read

Featherweight long read alignment using partitioned reference indexesSemantic proximity Read

Lossless Indexing with Counting de Bruijn GraphsSemantic proximity Read