Figure 1
From: Reference-free SNP detection: dealing with the data deluge
De Bruin graphs constructed from overlapping k-mers. De Bruijn graphs are networks of short overlapping sub-sequences of reads of length k. Typically, k-mers are set as the nodes in the graph and links are drawn between k-mers that have overlap of length k - 1, that is they overhang each other by just one nucleotide.