Fully Dynamic de Bruijn Graphs
classification
💻 cs.DS
keywords
bruijndynamicfullygraphsfixed-lengthimplementationjumbledmatching
read the original abstract
We present a space- and time-efficient fully dynamic implementation de Bruijn graphs, which can also support fixed-length jumbled pattern matching.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.