<abstract xmlns="http://www.w3.org/1999/xhtml"><p> The Robinson-Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. Using the graph theoretic approach based on a minimum-weight perfect matching in bipartite graphs, the values of similarity between clusters are transformed to the final MC-score of the dissimilarity of trees. The analyzed properties give insight into the structure of the metric space generated by MC, its relations with the Matching Split (MS) distance of unrooted trees and asymptotic behavior of the expected distance between binary n-leaf trees selected uniformly in both MC and MS (Θ(n<sup>3/2</sup>)).</p></abstract>

The Robinson-Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. Using the graph theoretic approach based on a minimum-weight perfect matching in bipartite graphs, the values of similarity between clusters are transformed to the final MC-score of the dissimilarity of trees. The analyzed properties give insight into the structure of the metric space generated by MC, its relations with the Matching Split (MS) distance of unrooted trees and asymptotic behavior of the expected distance between binary n-leaf trees selected uniformly in both MC and MS (Θ(n3/2)).

On a matching distance between rooted phylogenetic trees

Department of Algorithms and System Modeling, Faculty of Electronics, Telecommunications and Informatics Gdańsk University of Technology, Narutowicza 11/12, 80-233 Gdańsk, Poland

International Journal of Applied Mathematics and Computer Science

{"article-title":"On a matching distance between rooted phylogenetic trees"}

The Robinson-Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore...

On a matching distance between rooted phylogenetic trees

Data publikacji: 30 wrz 2013

Zakres stron: 669 - 684

DOI: https://doi.org/10.2478/amcs-2013-0050

This content is open access.