On the existence of funneled orientations for classes of rooted phylogenetic networks

被引:0
|
作者
Docker, Janosch [1 ]
Linz, Simone [1 ]
机构
[1] Univ Auckland, Sch Comp Sci, Auckland, New Zealand
关键词
Graph orientation; Network classes; Phylogenetic network; Rooted; Unrooted;
D O I
10.1016/j.tcs.2024.114908
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Recently, there has been a growing interest in the relationships between unrooted and rooted phylogenetic networks. In this context, a natural question to ask is if an unrooted phylogenetic network 1/' can be oriented as a rooted phylogenetic network such that the latter satisfies certain structural properties. In a recent preprint, Bulteau et al. claim that it is NP-hard to decide if 1/' has a funneled (resp. funneled tree-child) orientation, for when the internal vertices of 1/' have degree at most 5. Unfortunately, the proof of their funneled tree-child result appears to be incorrect. In this paper, we show that, despite their incorrect proof, it is NP-hard to decide if 1/' has a funneled tree-child orientation even if each internal vertex has degree 5 and that NP-hardness remains for other popular classes of rooted phylogenetic networks such as funneled normal and funneled reticulation-visible. Additionally, our results hold regardless of whether 1/' is rooted at an existing vertex or by subdividing an edge with the root.
引用
收藏
页数:12
相关论文
共 50 条
  • [1] Planar Rooted Phylogenetic Networks
    Moulton, Vincent
    Wu, Taoyang
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2023, 20 (02) : 1289 - 1297
  • [2] Drawing Rooted Phylogenetic Networks
    Huson, Daniel H.
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2009, 6 (01) : 103 - 109
  • [3] BIMLR: A method for constructing rooted phylogenetic networks from rooted phylogenetic trees
    Wang, Juan
    Guo, Maozu
    Xing, Linlin
    Che, Kai
    Liu, Xiaoyan
    Wang, Chunyu
    GENE, 2013, 527 (01) : 344 - 351
  • [4] Rearrangement moves on rooted phylogenetic networks
    Gambette, Philippe
    van Iersel, Leo
    Jones, Mark
    Lafond, Manuel
    Pardi, Fabio
    Scornavacca, Celine
    PLOS COMPUTATIONAL BIOLOGY, 2017, 13 (08) : e1005611
  • [5] Tanglegrams for rooted phylogenetic trees and networks
    Scornavacca, Celine
    Zickmann, Franziska
    Huson, Daniel H.
    BIOINFORMATICS, 2011, 27 (13) : I248 - I256
  • [6] The agreement distance of rooted phylogenetic networks
    Klawitter, Jonathan
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2019, 21 (03):
  • [7] An interchange property for the rooted phylogenetic subnet diversity on phylogenetic networks
    Coronado, Tomas M.
    Riera, Gabriel
    Rossello, Francesc
    JOURNAL OF MATHEMATICAL BIOLOGY, 2024, 89 (05)
  • [8] TripNet: A Method for Constructing Rooted Phylogenetic Networks from Rooted Triplets
    Poormohammadi, Hadi
    Eslahchi, Changiz
    Tusserkani, Ruzbeh
    PLOS ONE, 2014, 9 (09):
  • [9] A Survey of Methods for Constructing Rooted Phylogenetic Networks
    Wang, Juan
    PLOS ONE, 2016, 11 (11):
  • [10] Computing the Rooted Triplet Distance Between Phylogenetic Networks
    Jansson, Jesper
    Mampentzidis, Konstantinos
    Rajaby, Ramesh
    Sung, Wing-Kin
    COMBINATORIAL ALGORITHMS, IWOCA 2019, 2019, 11638 : 290 - 303