Next-Generation Sequence Assembly: Four Stages of Data Processing and Computational Challenges
Figure 3
Overlap-based approach for graph construction.
(A) Overlap graph where nodes are reads and edges are overlaps between them. (B) Example of a Hamiltonian path that visits each node (dotted circles) exactly once in the graph (note: starting node is chosen randomly). (C) Assembled reads corresponding to nodes that are traversed on the Hamiltonian path.