Alignment of Phylogenetic Networks

Copyright © 2007 G. Cardona, F. Rosselló, G. Valiente

The inputs for this demo are one or two phylogenetic networks in eNewick format.

The output is a full description of the networks.

If two networks are given and they have the same set of leaves, then also the μ-distance between them and an optimal alignment is obtained. If they do not have the same set of leaves, then the same computation is done on the topological restriction to their common leaves.

About the implementation: The perl package Bio::PhyloNetwork (accepted as part of the BioPerl bundle) parses the eNewick strings and computes all data available. The java applet showing the networks uses the package grappa.

About the default networks above: Phylogenies inferred from evolutionary distances among three species of frog: R. Aurora, R. Boylii and R. Temporaria (David M. Hillis, Thomas P. Wilcox, Phylogeny of the New World true frogs (Rana), Molecular Phylogenetics and Evolution, 34 (2005) 299-314) and enriched with a hypothetical reticulation event (between the R. Amerana and R. Laurasiana groups).

Theoretical background: Comparison of Tree-Child Phylogenetic Networks, Tripartitions do not always discriminate phylogenetic networks.