Fig. 5
From: Comparative genomics meets topology: a novel view on genome median and halving problems
A shortest sequence of DCJ-surgeries (of length 2) transforming an embedded graph G on a torus (with v=9, e=10, f=1) into an embedded graph H on a sphere (with v=11, e=10, f=1). a) The embedded graph G; b) An (intermediate) embedded graph G ′ on a torus with v=9, e=10, f=1; c) The embedded graph H. Blue crosses mark edges on which the DCJ-surgeries operate