Figure 4From: Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphsAn example illustrating problems with pointer jumping on bi-directed chains. The green colored arcs indicate valid pointer jumps, however the red colored arcs create cyclic loops and will create problems in the next pointer jumping operation.Back to article page