Fig. 3

The construction of the bi-labelled de Bruijn Graph. a Two Rmaps \(R_1\) and \(R_2\) and the bi-labels extracted from them—\(\{b_1,b_2,b_3\}\) from \(R_1\) and \(\{b_3,b_4\}\) from \(R_2\) for \(k=3\) and \(D=25\). b Edges \(\{e_1,e_2,e_3\}\) depict the proximal reduced set of bi-labels. Bi-labels \(\{b_1,b_4\}\) are represented by \(e_1\), bi-labels \(\{b_2,b_5\}\) are represented by \(e_2\) and bi-label \(\{b_3\}\) forms \(e_3\). We note that in this example no bi-labels are filtered for finding the proximal reduced set. c Nodes introduced into the graph. Each edge breaks into two nodes—one denoted by the prefix bi-label and the other by suffix bi-label of the edge. A directed edge is drawn from the former to the latter. d The final graph is formed by merging nodes \(v_{12}\) with \(v_{21}\) and merging \(v_{22}\) with \(v_{32}\)