CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2009 vol.6 Issue No.04 - October-December
Issue No.04 - October-December (2009 vol.6)
Gabriel Cardona , University of the Balearic Islands, Palma de-Mallorca
Mercè Llabrés , 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
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2009.33
We prove that Nakhleh's metric for reduced phylogenetic networks is also a metric on the classes of tree-child phylogenetic networks, semibinary tree-sibling time consistent phylogenetic networks, and multilabeled phylogenetic trees. We also prove that it separates distinguishable phylogenetic networks. In this way, it becomes the strongest dissimilarity measure for phylogenetic networks available so far. Furthermore, we propose a generalization of that metric that separates arbitrary phylogenetic networks.
Biology and genetics, graph algorithms, network problems.
Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, Gabriel Valiente, "On Nakhleh's Metric for Reduced Phylogenetic Networks", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.6, no. 4, pp. 629-638, October-December 2009, doi:10.1109/TCBB.2009.33