Fully Dynamic de Bruijn Graphs

Thumbnail Image
Date
2016-09-21
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer International Publishing
Abstract
We present a space- and time-efficient fully dynamic implementation of de Bruijn graphs, which can also support fixed-length jumbled pattern matching.
Description
Keywords
de Bruijn Graphs, Hashing, Fully dynamic data structures, Jumbled pattern matching
Citation
URI
http://dl.cerist.dz/handle/CERIST/871
Collections
International Conference Papers