Fully Dynamic de Bruijn Graphs

2016/07/17 by Belazzougui, Djamal, Gagie, Travis, Mäkinen, Veli +1
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1607.04909

Abstract

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

Related

• Implementation Of Dynamic De Bruijn Graphs Via Learned Index
• Variable-Order de Bruijn Graphs
• Space efficient merging of de Bruijn graphs and Wheeler graphs
• Random Rank-Based, Hierarchical or Trivial: Which Dynamic Graph Algorithm Performs Best in Practice?
• Recent Advances in Fully Dynamic Graph Algorithms