De Bruijn Graph ·
Eulerian Assembly
un
seel
.com · k-mers · overlap edges · O(V + E)
k-mers
8
edges used
0
/ 8
contig
—
tracing
—
(k−1)-mer node
k-mer edge (unused)
edge being consumed
edge in Eulerian path
▶ Play
←
→
🔇 Unmute
Reset
Un
seel
.com · De Bruijn Graph