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

Belazzougui, D., Gagie, T., Mäkinen, V., Previtali, M. (2016). Fully dynamic de Bruijn graphs. In String Processing and Information Retrieval (pp.145-152). GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND : Springer Verlag [10.1007/978-3-319-46049-9_14].

Fully dynamic de Bruijn graphs

Previtali, M
2016

Abstract

We present a space- and time-efficient fully dynamic implementation of de Bruijn graphs, which can also support fixed-length jumbled pattern matching.
Si
paper
Theoretical Computer Science; Computer Science (all)
English
International Symposium on String Processing and Information Retrieval, SPIRE 2016
9783319460482
Belazzougui, D., Gagie, T., Mäkinen, V., Previtali, M. (2016). Fully dynamic de Bruijn graphs. In String Processing and Information Retrieval (pp.145-152). GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND : Springer Verlag [10.1007/978-3-319-46049-9_14].
Belazzougui, D; Gagie, T; Mäkinen, V; Previtali, M
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/191356
Citazioni
  • Scopus 13
  • ???jsp.display-item.citation.isi??? 12
Social impact