Skip to main content
Fig. 2 | Algorithms for Molecular Biology

Fig. 2

From: Fast and efficient Rmap assembly using the Bi-labelled de Bruijn graph

Fig. 2

Skip segment overcomes missed cut-site. All bi-labels for \(k=3\) and \(D=25\) of two Rmaps R and \(R'\), \(\{b_1,b_2,b_3\}\) and \(\{b'_1,b'_2\}\) respectively. Both Rmaps cover the same genomic location but \(R'\) has a missed cut-site in position 5 (shown in red). On each bi-label the fragments from the k-mers and the length of the skip segment are shown in white while the fragments of the skip segment are shown in blue. Despite the missed cut-site on \(R'\) bi-labels \(b_1\) and \(b_2\) are merged to \(b'_1\) and \(b'_2\) respectively according to our merge function

Back to article page