Eulerian Path Reconstruction - Genome Assembly with de Bruijn Graphs Step by Step

An Eulerian path uses every k-mer edge once and spells the read.

highlighted = computed this step

Assembly asks for an edge-covering path

The graph has 3 k-mer edges. An Eulerian path uses every edge exactly 1 time.

\text{use every edge }1\text{ time}

Start with the first path node, then append the last base of each next node. The recomputed path reconstructs ATGCG.

\text{reconstruction}=\text{ATGCG}