On a matching distance between rooted phylogenetic trees - Publikacja - MOST Wiedzy

Wyszukiwarka

On a matching distance between rooted phylogenetic trees

Abstrakt

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)).

Cytowania

  • 1 8

    CrossRef

  • 1 7

    Web of Science

  • 2 0

    Scopus

Informacje szczegółowe

Kategoria:
Publikacja w czasopiśmie
Typ:
artykuł w czasopiśmie wyróżnionym w JCR
Opublikowano w:
International Journal of Applied Mathematics and Computer Science nr 23, strony 669 - 684,
ISSN: 1641-876X
Język:
angielski
Rok wydania:
2013
Opis bibliograficzny:
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:
Cyfrowy identyfikator dokumentu elektronicznego (otwiera się w nowej karcie) 10.2478/amcs-2013-0050
Weryfikacja:
Politechnika Gdańska

wyświetlono 30 razy

Publikacje, które mogą cię zainteresować

Meta Tagi