Fig. 1From: Read mapping on de Bruijn graphsIllustration 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 numbersBack to article page