Skip to main content
Figure 2 | BMC Bioinformatics

Figure 2

From: A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions

Figure 2

Improving the tree topology. The subtrees T1 and T2 are reconnected by an edge from s to v2, where s ∈ Cloud(v1, v ′ 1 MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGafmODayNbauaadaWgaaWcbaGaeGymaedabeaaaaa@2E72@ ) and v2 ∈ V2. The edge (v1, v ′ 1 MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGafmODayNbauaadaWgaaWcbaGaeGymaedabeaaaaa@2E72@ ) must be split into two edges (v1, s) and (s, v ′ 1 MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGafmODayNbauaadaWgaaWcbaGaeGymaedabeaaaaa@2E72@ ) before the new edge (s, v2) is added. Clouds are removed/generated accordingly.

Back to article page