Figure 3From: Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphsThe red nodes in Figure 3(b) indicate the nodes in the set V ' (STEP-1), similar red colored edges indicate the edges in E '. After list ranking (STEP-3) we will have four maximal chains as follows, ( Y 2 − , Y 3 + ) , ( Y 3 − , Y 2 + ) , ( X 1 − , X 2 + , X 3 − ) ( X 3 + , X 2 − , X 1 + ) . Now if we stick to the convention described in STEP-5 we renumber the new node corresponding to the chains ( Y 2 − , Y 3 + ) , ( Y 3 − , Y 2 + ) as Y 2 . As a result the edges ( Y 3 + , Y 4 − ) and ( Y 4 + , Y 3 − ) are updated (shown in green in Figure 3(c)) as ( Y 2 − , Y 4 − ) and ( Y 4 + , Y 2 + ) Finally the directed edges are replaced with bi-directed edges in Figure 3(d).Back to article page