Conference Proceedings

Fully dynamic de Bruijn graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016) 9954 LNCS 145-152
DOI: 10.1007/978-3-319-46049-9_14
15Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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

Cite

CITATION STYLE

APA

Belazzougui, D., Gagie, T., Mäkinen, V., & Previtali, M. (2016). Fully dynamic de Bruijn graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9954 LNCS, pp. 145–152). Springer Verlag. https://doi.org/10.1007/978-3-319-46049-9_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free