Search
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 (Θ(n^1.5)).
Citations
-
4 0
CrossRef
-
0
Web of Science
-
4 3
Scopus
Authors (2)
Cite as
Full text
- Publication version
- Accepted or Published Version
- DOI:
- Digital Object Identifier (open in new tab) 10.2478/amcs-2013-0050
- License
-
open in new tab
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
International Journal of Applied Mathematics and Computer Science
no. 23,
pages 669 - 684,
ISSN: 1641-876X - Language:
- English
- Publication year:
- 2013
- Bibliographic description:
- Bogdanowicz D., Giaro K.: On a matching distance between rooted phylogenetic trees// International Journal of Applied Mathematics and Computer Science. -Vol. 23, nr. 3 (2013), s.669-684
- DOI:
- Digital Object Identifier (open in new tab) 10.2478/amcs-2013-0050
- Verified by:
- Gdańsk University of Technology
seen 171 times