Overlap graph
new edge
transitive (to remove)
non-best (dropped)
current unitig path
current read
contained (removed)
Reads are single-stranded and error-free. Overlap: for every ordered pair, the longest exact match between a suffix of one read and a prefix of the other (a dove-tail) of at least the minimum length becomes an edge. Reduce: an edge v→x is transitive if some v→w→x explains the same placement of x, i.e. the overhang lengths add up; it is removed (Myers 2005). Compact: maximal paths whose inner vertices have one edge in and one out are merged into unitigs. Drag nodes to tidy the drawing; hover an edge to see the overlap. Keys: → step, ← back, n next stage, f run all, r reset.