English

Fully Dynamic de Bruijn Graphs

Data Structures and Algorithms 2016-07-21 v2

Abstract

We present a space- and time-efficient fully dynamic implementation de Bruijn graphs, which can also support fixed-length jumbled pattern matching.

Cite

@article{arxiv.1607.04909,
  title  = {Fully Dynamic de Bruijn Graphs},
  author = {Djamal Belazzougui and Travis Gagie and Veli Mäkinen and Marco Previtali},
  journal= {arXiv preprint arXiv:1607.04909},
  year   = {2016}
}

Comments

Presented at the 23rd edition of the International Symposium on String Processing and Information Retrieval (SPIRE 2016)

R2 v1 2026-06-22T14:56:47.559Z