Skip to main content
. 2017 Jul 12;33(14):i133–i141. doi: 10.1093/bioinformatics/btx261

Fig. 1.

Fig. 1.

Weighted de Bruijn Graph invariant. The nodes are 4-mers and edges are 5-mers. The nodes and edges are drawn from Read1 and Read2 mentioned in the figure. The solid curve shows the read path. The nodes/edges are not canonicalized