Next-Generation Sequence Assembly: Four Stages of Data Processing and Computational Challenges
Figure 4
K-spectrum–based approach for graph construction.
(A) de Bruijn graph where the nodes are k-mers and edges are k–1 overlaps between them. (B) Example of an Eulerian path that visits each edge (dotted arrows) exactly once in the graph (note: numbers represent the order of visiting edges). (C) Assembled reads corresponding to the edges that are traversed on the Eulerian path.