Belazzougui, DjamalGagie, TravisMäkinen, VeliPrevitali, Marco2016-12-082016-12-082016-09-21978-3-319-46049-9978-3-319-46048-2http://dl.cerist.dz/handle/CERIST/871We present a space- and time-efficient fully dynamic implementation of de Bruijn graphs, which can also support fixed-length jumbled pattern matching.de Bruijn GraphsHashingFully dynamic data structuresJumbled pattern matchingConference paper