A tale of optimizing the space taken by de Bruijn graphs

DOI10.1007/978-3-030-80049-9_11OpenAlexW3182485537MaRDI QIDQ2117772FDOQ2117772

Rayan Chikhi

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80049-9_11

zbMATH Keywords

data structuresbioinformaticsde Bruijn graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Dynamic alignment-free and reference-free read compression
• Title not available (Why is that?)
• Scaling metagenome sequence assembly with probabilistic de Bruijn graphs
• Hierarchical overlap graph
• Disk compression of \(k\)-mer sets
• Succinct de Bruijn Graphs

Uses Software

• SPAdes
• Velvet
• ABySS
• MEGAHIT
• DARRC
• Salmon
• IDBA

This page was built for publication: A tale of optimizing the space taken by de Bruijn graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117772)