Metrics for Phylogenetic Networks I: Generalizations of the Robinson-Foulds Metric

被引:42
|
作者
Cardona, Gabriel [1 ]
Llabres, Merce [1 ]
Rossello, Francesc [1 ]
Valiente, Gabriel [2 ]
机构
[1] Univ Balearic Isl, Dept Math & Comp Sci, E-07122 Palma de Mallorca, Spain
[2] Tech Univ Catalonia, Formal Methods Res Grp, E-08034 Barcelona, Spain
关键词
Biology and genetics; life and medical sciences; computer applications; graph algorithms; graph theory; discrete mathematics; mathematics of computing; trees; RECOMBINATION EVENTS; MINIMUM NUMBER; GENE-TRANSFER; ALGORITHMS; BACTERIAL; DISTANCE;
D O I
10.1109/TCBB.2008.70
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
The assessment of phylogenetic network reconstruction methods requires the ability to compare phylogenetic networks. This is the first in a series of papers devoted to the analysis and comparison of metrics for tree-child time-consistent phylogenetic networks on the same set of taxa. In this paper, we study three metrics that have already been introduced in the literature: the Robinson-Foulds distance, the tripartition distance, and the mu-distance. They generalize to networks the classical Robinson-Foulds or partition distance for phylogenetic trees. We analyze the behavior of these metrics by studying their least and largest values and when they achieve them. As a by-product of this study, we obtain tight bounds on the size of a tree-child time-consistent phylogenetic network.
引用
收藏
页码:46 / 61
页数:16
相关论文
共 50 条
  • [1] Properties of the generalized Robinson-Foulds metric
    Borozan, L.
    Matijevic, D.
    Canzar, S.
    [J]. 2019 42ND INTERNATIONAL CONVENTION ON INFORMATION AND COMMUNICATION TECHNOLOGY, ELECTRONICS AND MICROELECTRONICS (MIPRO), 2019, : 330 - 335
  • [2] Efficiently computing the Robinson-Foulds metric
    Pattengale, Nicholas D.
    Gottlieb, Eric J.
    Moret, Bernard M. E.
    [J]. JOURNAL OF COMPUTATIONAL BIOLOGY, 2007, 14 (06) : 724 - 735
  • [3] Robinson-Foulds Reticulation Networks
    Markin, Alexey
    Anderson, Tavis K.
    Vadali, Venkata Sai Krishna Teja
    Eulenstein, Oliver
    [J]. ACM-BCB'19: PROCEEDINGS OF THE 10TH ACM INTERNATIONAL CONFERENCE ON BIOINFORMATICS, COMPUTATIONAL BIOLOGY AND HEALTH INFORMATICS, 2019, : 77 - 86
  • [4] Faster computation of the Robinson-Foulds distance between phylogenetic networks
    Asano, Tetsuo
    Jansson, Jesper
    Sadakane, Kunihiko
    Uehara, Ryuhei
    Valiente, Gabriel
    [J]. INFORMATION SCIENCES, 2012, 197 : 77 - 90
  • [5] Information theoretic generalized Robinson-Foulds metrics for comparing phylogenetic trees
    Smith, Martin R.
    [J]. BIOINFORMATICS, 2020, 36 (20) : 5007 - 5013
  • [6] Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks
    Asano, Tetsuo
    Jansson, Jesper
    Sadakane, Kunihiko
    Uehara, Ryuhei
    Valiente, Gabriel
    [J]. COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2010, 6129 : 190 - +
  • [7] The Generalized Robinson-Foulds Distance for Phylogenetic Trees
    Llabres, Merce
    Rossello, Francesc
    Valiente, Gabriel
    [J]. JOURNAL OF COMPUTATIONAL BIOLOGY, 2021, 28 (12) : 1181 - 1195
  • [8] A program to compute the soft Robinson-Foulds distance between phylogenetic networks
    Lu, Bingxin
    Zhang, Louxin
    Leong, Hon Wai
    [J]. BMC GENOMICS, 2017, 18
  • [9] Robinson-Foulds Supertrees
    Bansal, Mukul S.
    Burleigh, J. Gordon
    Eulenstein, Oliver
    Fernandez-Baca, David
    [J]. ALGORITHMS FOR MOLECULAR BIOLOGY, 2010, 5
  • [10] Robinson-Foulds Supertrees
    Mukul S Bansal
    J Gordon Burleigh
    Oliver Eulenstein
    David Fernández-Baca
    [J]. Algorithms for Molecular Biology, 5