Skip to main content
Fig. 2 | Algorithms for Molecular Biology

Fig. 2

From: Investigating the complexity of the double distance problems

Fig. 2

Breakpoint graph of genomes \(\mathbb {S}_1=\{\,(\mathtt {1\,2})\,[\texttt{3}\,\overline{\texttt{4}}]\,\}\) and \(\mathbb {S}_2=\{\,(\texttt{1}\,\overline{\texttt{3}}\,\texttt{2})\,[\texttt{4}]\,\}\). Edge types are distinguished by colors: \(\mathbb {S}_1\)-edges are drawn in blue and \(\mathbb {S}_2\)-edges are drawn in black. Similarly, vertex types are distinguished by colors: an \(\mathbb {S}_1\)-telomere is marked in blue, an \(\mathbb {S}_2\)-telomere is marked in gray, a telomere in both \(\mathbb {S}_1\) and \(\mathbb {S}_2\) is marked in purple and non-telomeric vertices are white. This graph has one 2-cycle, one 0-path and one 4-path

Back to article page