Skip to main content
. 2013 Dec 12;9(12):e1003345. doi: 10.1371/journal.pcbi.1003345

Figure 3. Overlap-based approach for graph construction.

Figure 3

(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.