Abstract. To analyse various properties of the search process of genetic programming it is useful to quantify the distance between two individuals. Using operator-based distance me...
Leonardo Vanneschi, Steven Gustafson, Giancarlo Ma...
Abstract—The high-level synthesis process allows the automatic design and implementation of digital circuits starting from a behavioral description. Evolutionary algorithms are v...
Christian Pilato, Gianluca Palermo, Antonino Tumeo...
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
We present new and novel insights into the behavior of two maximum parsimony heuristics for building evolutionary trees of different sizes. First, our results show that the heuris...
Seung-Jin Sul, Suzanne Matthews, Tiffani L. Willia...
Traditional phylogenetic tree reconstruction is based on point mutations of a single gene. This approach is hardly suitable for genomes whose genes are almost identical and hardly...