Skip to main content
Fig. 1 | BMC Bioinformatics

Fig. 1

From: Read mapping on de Bruijn graphs

Fig. 1

Illustration of the gadget used in the proof of Theorem 1. Encoding a directed graph into a DBG of order 2. The directed graph G (top) admits the same words than the 2-DBG G (bottom), if we ignore the numbers

Back to article page