Comparing Phylogenetic Trees by Matching Nodes Using the Transfer Distance Between Partitions

被引:12
|
作者
Bogdanowicz, Damian [1 ]
Giaro, Krzysztof [1 ]
机构
[1] Gdansk Univ Technol, Dept Algorithms & Syst Modeling, Narutowicza 11-12, PL-80233 Gdansk, Poland
关键词
matching pair distance; minimum-weight perfect matching; phylogenetic tree comparison; phylogenetic tree metric; SCALING ALGORITHMS; EXACT COMPUTATION; SUBTREE PRUNE; DISTRIBUTIONS; ASSIGNMENT; METRICS;
D O I
10.1089/cmb.2016.0204
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Ability to quantify dissimilarity of different phylogenetic trees describing the relationship between the same group of taxa is required in various types of phylogenetic studies. For example, such metrics are used to assess the quality of phylogeny construction methods, to define optimization criteria in supertree building algorithms, or to find horizontal gene transfer (HGT) events. Among the set of metrics described so far in the literature, the most commonly used seems to be the Robinson-Foulds distance. In this article, we define a new metric for rooted trees-the Matching Pair (MP) distance. The MP metric uses the concept of the minimum-weight perfect matching in a complete bipartite graph constructed from partitions of all pairs of leaves of the compared phylogenetic trees. We analyze the properties of the MP metric and present computational experiments showing its potential applicability in tasks related to finding the HGT events.
引用
收藏
页码:422 / 435
页数:14
相关论文
共 49 条
  • [1] ON A MATCHING DISTANCE BETWEEN ROOTED PHYLOGENETIC TREES
    Bogdanowicz, Damian
    Giaro, Krzysztof
    [J]. INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, 2013, 23 (03) : 669 - 684
  • [2] Comparing phylogenetic trees using a minimum weight perfect matching
    Bogdanowicz, Damian
    [J]. PROCEEDINGS OF THE 2008 1ST INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY, 2008, : 451 - 454
  • [3] Cluster Matching Distance for Rooted Phylogenetic Trees
    Moon, Jucheol
    Eulenstein, Oliver
    [J]. BIOINFORMATICS RESEARCH AND APPLICATIONS, ISBRA 2018, 2018, 10847 : 321 - 332
  • [4] Transfer distance between partitions
    Denoeud, Lucile
    [J]. ADVANCES IN DATA ANALYSIS AND CLASSIFICATION, 2008, 2 (03) : 279 - 294
  • [5] Transfer distance between partitions
    Lucile Denœud
    [J]. Advances in Data Analysis and Classification, 2008, 2 : 279 - 294
  • [6] Matching Split Distance for Unrooted Binary Phylogenetic Trees
    Bogdanowicz, Damian
    Giaro, Krzysztof
    [J]. IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2012, 9 (01) : 150 - 160
  • [7] ON THE TOTAL DISTANCE BETWEEN NODES IN TREES
    Moon
    [J]. Journal of Systems Science & Complexity, 1996, (01) : 93 - 96
  • [8] Maximum transfer distance between partitions
    Charon, Irene
    Denoeud, Lucile
    Guenoche, Alain
    Hudry, Olivier
    [J]. JOURNAL OF CLASSIFICATION, 2006, 23 (01) : 103 - 121
  • [9] Maximum Transfer Distance Between Partitions
    Irene Charon
    Lucile Denoeud
    Alain Guenoche
    Olivier Hudry
    [J]. Journal of Classification, 2006, 23 : 103 - 121
  • [10] On the linear-cost subtree-transfer distance between phylogenetic trees
    DasGupta, B
    He, X
    Jiang, T
    Li, M
    Tromp, J
    [J]. ALGORITHMICA, 1999, 25 (2-3) : 176 - 195