Fig. 2From: Achieving large and distant ancestral genome inference by using an improved discrete quantum-behaved particle swarm optimization algorithmThe median problem. Find a median genome \(G_m\) that minimizes the sum of DCJ distance denoted by \(\sum _{i=1}^{3}d(G_i,G_m)\) if given three genomes \(G_1\), \(G_2\), and \(G_3\)Back to article page