Fig. 7

Adjacent repeated fragment sets examples. The two subfigures represent the multiplied link (and its reverse) \(((c, f), (d, f)) \in \mathcal {L}{}\), where \(mult(c) = 2\) and \(mult(d) = 2\), so that \(contig(u_{or,occ}) = c\) and \(contig(v_{or,occ}) = d\). Two vertices of the same colour visualise a repeated fragment. Bold edges (canonical) are the ones that belong to the adjacent repeated fragments sets. The functions \(diradj\)/\(invadj\) enable to retrieve the normal edges with the bold ones, and vice-versa. Dashed edges do not participate in \(ADirF{}\)/\(AInvF{}\). Remember that \(\forall (u, v) \in E, \left( {\overline{v}, \overline{u}}\right) \in E\). a \(diradj\,({u_{f,0}, v_{f,0}}) = \left( {u_{f,1}, v_{f,1}}\right)\); b \(invadj\,({u_{f,0}, v_{f,0}}) = \left( {v_{r,1}, u_{r,1}}\right)\)