Figure 1From: A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositionsAdding a node. A new node π can either be added to (a) a node v in the tree or (b) to a point s in a cloud of an edge (v, v'). In the latter case, we have to split the edge (v, v') into two edges (v, s) and (s, v'). Clouds are removed/generated accordingly.Back to article page