Figure 4
From: DCJ-indel and DCJ-substitution distances with distinct operation costs
Two optimal sequences for DCJ-sorting an AB -path with Λ =3 (the cuts of each DCJ in each sequence are represented by “ |”). In (i) the overall number of runs in the resulting components is three, while in (ii) the resulting components have only two runs. Indeed, in this case, the best we can have is the indel-potential λ=2.