Fully dynamic de Bruijn graphs

DOI10.1007/978-3-319-46049-9_14MaRDI QIDQ1796842zbMATH OpenOpenAlexFDO

Authors Travis Gagie, Veli Mäkinen, Marco Previtali, Djamal Belazzougui

Publication date 17 October 2018

Full work available at URL https://arxiv.org/abs/1607.04909

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Abstract: We present a space- and time-efficient fully dynamic implementation de Bruijn graphs, which can also support fixed-length jumbled pattern matching.

Cited in

(5)

• Representation of \(k\)-mer sets using spectrum-preserving string sets
• scientific article; zbMATH DE number 7559178 (Why is no real title available?)
• Bidirectional Variable-Order de Bruijn Graphs
• The design of (almost) disjunct matrices by evolutionary algorithms
• Tight bounds for monotone minimal perfect hashing

This page was built for publication: Fully dynamic de Bruijn graphs

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