Fully Dynamic de Bruijn Graphs
  We present a space- and time-efficient fully dynamic implementation de Bruijn graphs, which can also support fixed-length jumbled pattern matching. 
Djamal Belazzougui and Travis Gagie and Veli M\"akinen and Marco   Previtali
cs.DS