Fig. 1

Schematic diagram for the construction, decomposition and reorganization of the colored de Bruijn graph. a The three original sequences. b The colored de Bruijn graph with k equal to 3. Each colored circle represents a node, and the black arrows represent edges. The characters above the node represent each node's label, visit order and color. The number below node represents the theoretical offset value of each node. \(\mathbf{c}\) The result of visiting against the direction of the edge. The numbers below the node represent the final offset value and preoffset value. \(\mathbf{d}\) The cSupB tree structure. Here, we find five cSupBs in the following order: bub1.\(<\mathrm{TAT},\mathrm{ACC},111 >\); bub2.\(<\mathrm{GGG},\mathrm{GTA},110>\); bub3.\(<\mathrm{CAC},\mathrm{GTA},011>\); bub4.\(<\mathrm{TCA},\mathrm{GGG},110>\); and bub5.\(<\mathrm{TCA},\mathrm{GTA},111>\). \(\mathbf{e}\) The final decomposition and representation of the colored de Bruijn graph