Quality criteria of genetic algorithms for construction of phylogenetic trees

In this article the suitability of two different tree representations for the construction of phylogenetic trees with genetic algorithms is examined. On the one hand tree topologies are represented by means of a distance matrix while on the other hand the Prüfer number tree representation is used. To assess the adequacy of both approaches a set of recently proposed quality criteria is used. The quality criteria can be used to monitor genetic algorithm approaches differing in configuration and setup, fitness function, or representation. In addition to the criteria for the repeatability of the optimization, criteria for the coverage of the search space are also used. On the basis of the optimization results of simulated data, the quality criteria show, in contrast to the error plots, a clear difference in the efficiency of both representations. It is concluded that the Prüfer number representation yields a diverse set of good quality topologies while the distance matrix representation mainly returns the optimal topology.