The Community for Technology Leaders
Green Image
Issue No. 04 - October-December (2009 vol. 6)
ISSN: 1545-5963
pp: 552-569
Gabriel Cardona , University of the Balearic Islands, Palma de Mallorca
Francesc Rosselló , University of the Balearic Islands, Palma de Mallorca
Gabriel Valiente , Technical University of Catalonia, Barcelona
Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of nontreelike evolutionary events, like recombination, hybridization, or lateral gene transfer. While much progress has been made to find practical algorithms for reconstructing a phylogenetic network from a set of sequences, all attempts to endorse a class of phylogenetic networks (strictly extending the class of phylogenetic trees) with a well-founded distance measure have, to the best of our knowledge and with the only exception of the bipartition distance on regular networks, failed so far. In this paper, we present and study a new meaningful class of phylogenetic networks, called tree-child phylogenetic networks, and we provide an injective representation of these networks as multisets of vectors of natural numbers, their path multiplicity vectors. We then use this representation to define a distance on this class that extends the well-known Robinson-Foulds distance for phylogenetic trees and to give an alignment method for pairs of networks in this class. Simple polynomial algorithms for reconstructing a tree-child phylogenetic network from its path multiplicity vectors, for computing the distance between two tree-child phylogenetic networks and for aligning a pair of tree-child phylogenetic networks, are provided. They have been implemented as a Perl package and a Java applet, which can be found at
Phylogenetic network, tree-child phylogenetic network, phylogenetic tree, partition distance, network alignment.

F. Rosselló, G. Valiente and G. Cardona, "Comparison of Tree-Child Phylogenetic Networks," in IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 6, no. , pp. 552-569, 2007.
83 ms
(Ver 3.3 (11022016))