Skip to main content
Fig. 1 | BMC Bioinformatics

Fig. 1

From: Comparative genomics meets topology: a novel view on genome median and halving problems

Fig. 1

For an all-duplicated genome A=(−a−b+g+d+f+g+e)(−a+c−f−c−b−d−e) and an ordinary genome R=(−a−b−d−g+f−c−e), a) the genome graph \(\mathfrak {G}(A)\); b) the contracted breakpoint graph \(\hat {\mathfrak {G}}(A,R)\); c) a maximal AR-cycle decomposition of \(\hat {\mathfrak {G}}(A,2R)\), which represents the ht-decomposition with respect to the clockwise orientation of A-cycles

Back to article page