Two Results on Distances for Phylogenetic Networks

Abstract

We establish two new results on distances for phylogenetic networks. First, that Nakhleh’s metric for reduced networks [15] is a metric on the class of semibinary tree-sibling networks, being thus the only non-trivial metric computable in polynomial-time available so far on this class. And second, that a simple general- ization of the nodal distance from binary phylogenetic trees to binary phylogenetic networks has the same separation power as the one given in [8].