Dissemin is shutting down on January 1st, 2025

Published in

Springer Verlag, Lecture Notes in Computer Science, p. 145-152

DOI: 10.1007/978-3-319-46049-9_14

Links

Tools

Export citation

Search in Google Scholar

Fully Dynamic de Bruijn Graphs

Book chapter published in 2016 by Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

We present a space- and time-efficient fully dynamic implementation de Bruijn graphs, which can also support fixed-length jumbled pattern matching. ; Comment: Presented at the 23rd edition of the International Symposium on String Processing and Information Retrieval (SPIRE 2016)