Szukana fraza: [Abstract = "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."]

Wyników: 1