Bidirectional Variable-Order de Bruijn Graphs
Puglisi, Simon J.
Implementing de Bruijn graphs compactly is an important problem because of their role in genome assembly. There are currently two main approaches, one using Bloom filters and the other using a kind of Burrows-Wheeler Transform on the edge labels of the graph. The second representation is more elegant and can even handle many graph-orders at once, but it does not cleanly support traversing edges backwards or inserting new nodes or edges. In this paper we resolve the first of these issues and partially address the second.
de Bruijn Graphs, Bidirectional navigation, Burrows-Wheeler transform, Variable order
ISBN : 978-3-662-49529-2 ; 978-3-662-49528-5
Springer International Publishing