Next-Generation Sequence Assembly: Four Stages of Data Processing and Computational Challenges
Figure 5
Greedy-based approach for graph construction.
(A) Example of a greedy path (dotted arrows) that visits the nodes in the order of maximum overlap length (note: starting node is chosen randomly; at each node the greedy algorithm will choose the next visitor based on the maximum overlap length between this node and its connected neighbors). (B) Assembled reads corresponding to nodes that are traversed on the greedy path.