Fully Dynamic de Bruijn Graphs
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.
Presented at the 23rd edition of the International Symposium on String Processing and Information Retrieval (SPIRE 2016)