Fully Dynamic de Bruijn Graphs
Djamal Belazzougui, Travis Gagie, Veli M\"akinen, Marco, Previtali
TL;DR
This paper introduces a fully dynamic de Bruijn graph implementation that is both space- and time-efficient, capable of supporting fixed-length jumbled pattern matching.
Contribution
It presents a novel dynamic de Bruijn graph data structure with efficient update and query capabilities, including pattern matching support.
Findings
Achieves improved space and time efficiency over previous methods.
Supports fixed-length jumbled pattern matching within the dynamic graph.
Demonstrates practical applicability in bioinformatics and data analysis.
Abstract
We present a space- and time-efficient fully dynamic implementation de Bruijn graphs, which can also support fixed-length jumbled pattern matching.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Network Packet Processing and Optimization · DNA and Biological Computing