Extremely fast construction and querying of compacted and colored de Bruijn graphs with GGCAT

(Downloading may take up to 30 seconds. If the slide opens in your browser, select File -> Save As to save it.)

Click on image to view larger version.

Figure 2.
Figure 2.

The extension step of the intermediate unitig construction happens inside each group. For each k-mer (top), it looks for a possible extension by checking all of the four possible neighbor k-mers in both directions and extends the k-mer (bottom) only if there is exactly one match both forward and backward (depicted in green in the first two figures from the top). Then it repeats the same process until no more extensions can be performed.

This Article

  1. Genome Res. 33: 1198-1207

Preprint Server