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

Fig. 3

From: Investigating the complexity of the double distance problems

Fig. 3

i Ambiguous breakpoint graph \(ABG(\mathbb {S}, \check{\mathbb {D}})\) for genomes \(\mathbb {S}=\{[\mathtt {1\,2\,3}]\}\) and \(\check{\mathbb {D}}=\{[\mathtt {1_a\,2_a}\,\overline{\texttt{3}}_\texttt{a}\,\mathtt {1_b}]\,[\overline{\texttt{3}}_\texttt{b}\,\mathtt {2_b}]\}\). Edge types are distinguished by colors: \(\check{\mathbb {D}}\)-edges are drawn in black and \(\mathbb {S}\)-edges (squares) are drawn in red. ii Induced breakpoint graph \(BG(\tau ,\check{\mathbb {D}})\) in which all squares are resolved by the solution \(\tau =(\{\texttt{1}_\texttt{a}^h\texttt{2}_\texttt{a}^t,\texttt{1}_\texttt{b}^h\texttt{2}_\texttt{b}^t\},\{\texttt{2}_\texttt{a}^h\texttt{3}_\texttt{b}^t,\texttt{2}_\texttt{b}^h\texttt{3}_\texttt{a}^t\}\})\), resulting in one 2-cycle, two 0-paths, one 2-path and one 4-path. This is also the breakpoint graph of \(\check{\mathbb {D}}\) and \(\mathbb {B}=\{[\mathtt {1_a\,2_a\,3_b}],[\mathtt {1_b\,2_b\,3_a}]\} \in \mathfrak {S}^\texttt{a}_\texttt{b}(\texttt{2}\mathbb {S})\). In both i and ii, vertex types are distinguished by colors: telomeres in \(\mathbb {S}\) are marked in blue, telomeres in \(\check{\mathbb {D}}\) are marked in gray, telomeres in both \(\mathbb {S}\) and \(\check{\mathbb {D}}\) are marked in purple and non-telomeric vertices are white

Back to article page