Computing the Rooted Triplet Distance Between Phylogenetic Networks

被引:1
|
作者
Jansson, Jesper [1 ]
Mampentzidis, Konstantinos [2 ]
Rajaby, Ramesh [3 ]
Sung, Wing-Kin [3 ]
机构
[1] Hong Kong Polytech Univ, Hung Hom, Kowloon, Hong Kong, Peoples R China
[2] Aarhus Univ, Dept Comp Sci, Aarhus, Denmark
[3] Natl Univ Singapore, Sch Comp, Singapore, Singapore
来源
COMBINATORIAL ALGORITHMS, IWOCA 2019 | 2019年 / 11638卷
基金
新加坡国家研究基金会;
关键词
TREES;
D O I
10.1007/978-3-030-25005-8_24
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The rooted triplet distance measures the structural dissimilarity of two phylogenetic trees or networks by counting the number of rooted trees with exactly three leaf labels that occur as embedded subtrees in one, but not both of them. Suppose that N-1 = (V-1, E-1) and N-2 = (V-2, E-2) are rooted phylogenetic networks over a common leaf label set of size., that N-i has level k(i) and maximum in-degree d(i) for i. {1, 2}, and that the networks' out-degrees are unbounded. Denote n = max(vertical bar V-1 vertical bar, vertical bar V-2 vertical bar|), m = max(vertical bar E-1 vertical bar, vertical bar E-2 vertical bar), k = max(k(1), k(2)), and d = max(d(1), d(2)). Previous work has shown how to compute the rooted triplet distance between N-1 and N-2 in O(. log.) time in the special case k = 1. For k > 1, no efficient algorithms are known; a trivial approach leads to a running time of Omega(n(7) lambda(3)) and the only existing non-trivial algorithm imposes restrictions on the networks' in- and out-degrees (in particular, it does not work when non-binary nodes are allowed). In this paper, we develop two new algorithms that have no such restrictions. Their running times are O(n(2)m +lambda(3)) and O(m + k(3)d(3) lambda + lambda(3)), respectively. We also provide implementations of our algorithms and evaluate their performance in practice. This is the first publicly available software for computing the rooted triplet distance between unrestricted networks of arbitrary levels.
引用
收藏
页码:290 / 303
页数:14
相关论文
共 50 条
  • [31] Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree
    Brodal, Gerth Stolting
    Fagerberg, Rolf
    Mailund, Thomas
    Pedersen, Christian N. S.
    Sand, Andreas
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 1814 - 1832
  • [32] On the existence of funneled orientations for classes of rooted phylogenetic networks
    Docker, Janosch
    Linz, Simone
    THEORETICAL COMPUTER SCIENCE, 2025, 1023
  • [33] A review of metrics measuring dissimilarity for rooted phylogenetic networks
    Wang, Juan
    Guo, Maozu
    BRIEFINGS IN BIOINFORMATICS, 2019, 20 (06) : 1972 - 1980
  • [34] Faster computation of the Robinson-Foulds distance between phylogenetic networks
    Asano, Tetsuo
    Jansson, Jesper
    Sadakane, Kunihiko
    Uehara, Ryuhei
    Valiente, Gabriel
    INFORMATION SCIENCES, 2012, 197 : 77 - 90
  • [35] A program to compute the soft Robinson–Foulds distance between phylogenetic networks
    Bingxin Lu
    Louxin Zhang
    Hon Wai Leong
    BMC Genomics, 18
  • [36] Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks
    Asano, Tetsuo
    Jansson, Jesper
    Sadakane, Kunihiko
    Uehara, Ryuhei
    Valiente, Gabriel
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2010, 6129 : 190 - +
  • [37] Recent Progresses in the Combinatorial and Algorithmic Study of Rooted Phylogenetic Networks
    Zhang, Louxin
    WALCOM: ALGORITHMS AND COMPUTATION (WALCOM 2020), 2020, 12049 : 22 - 27
  • [38] Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks
    Doecker, Janosch
    Linz, Simone
    Semple, Charles
    ADVANCES IN APPLIED MATHEMATICS, 2024, 152
  • [39] Dendroscope 3: An Interactive Tool for Rooted Phylogenetic Trees and Networks
    Huson, Daniel H.
    Scornavacca, Celine
    SYSTEMATIC BIOLOGY, 2012, 61 (06) : 1061 - 1067
  • [40] The mean value of the squared path-difference distance for rooted phylogenetic trees
    Mir, Arnau
    Russello, Francesc
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2010, 371 (01) : 168 - 176