Springer Verlag, Lecture Notes in Computer Science, p. 145-152
DOI: 10.1007/978-3-319-46049-9_14
Full text: Download
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)