Algorithms on Trees and Graphs
Algorithms on Trees and Graphs
Phylogenetic Networks: Modeling, Reconstructibility, and Accuracy
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The Number of Recombination Events in a Sample History: Conflict Graph and Lower Bounds
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Computing the minimum number of hybridization events for a consistent evolutionary history
Discrete Applied Mathematics
The Fine Structure of Galls in Phylogenetic Networks
INFORMS Journal on Computing
Metrics for Phylogenetic Networks II: Nodal and Triplets Metrics
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Comparison of Tree-Child Phylogenetic Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Metrics for Phylogenetic Networks II: Nodal and Triplets Metrics
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Path lengths in tree-child time consistent hybridization networks
Information Sciences: an International Journal
A Metric on the Space of Reduced Phylogenetic Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Faster computation of the Robinson-Foulds distance between phylogenetic networks
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Metrics on Multilabeled Trees: Interrelationships and Diameter Bounds
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Faster computation of the Robinson-Foulds distance between phylogenetic networks
Information Sciences: an International Journal
Hi-index | 0.00 |
The assessment of phylogenetic network reconstruction methods requires the ability to compare phylogenetic networks. This is the first in a series of papers devoted to the analysis and comparison of metrics for tree-child time consistent phylogenetic networks on the same set of taxa. In this paper, we study three metrics that have already been introduced in the literature: the Robinson-Foulds distance, the tripartitions distance and the $\mu$-distance. They generalize to networks the classical Robinson-Foulds or partition distance for phylogenetic trees. We analyze the behavior of these metrics by studying their least and largest values and when they achieve them. As a by-product of this study, we obtain tight bounds on the size of a tree-child time consistent phylogenetic network.