Fig. 4From: Achieving large and distant ancestral genome inference by using an improved discrete quantum-behaved particle swarm optimization algorithmThe illustration of algorithm overview. Assuming each generation contains a set of M genomes represented as \(X_{1d}...X_{Md}\), as well as mbest and \(P_{id}\). The population of the next generation is created by sorting each \(X_{id}\) toward the best genomeBack to article page