Skip to main content
. 2014 May 20;15(Suppl 4):S10. doi: 10.1186/1471-2164-15-S4-S10

Figure 1.

Figure 1

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.