Implementation and evaluation of space-efficient traversal algorithms on succinct de Bruijn graphs
This paper presents the first implementation and evaluation of space-efficient BFS and DFS traversal algorithms on succinct de Bruijn graphs, demonstrating significant reductions in auxiliary memory usage (up to 11×) and overall memory footprint (up to 2.36×) on a graph with 800 million edges.