Exploring spaces of semi-directed level-1 networks

被引:0
|
作者
Simone Linz
Kristina Wicke
机构
[1] University of Auckland,School of Computer Science
[2] New Jersey Institute of Technology,Department of Mathematical Sciences
来源
Journal of Mathematical Biology | 2023年 / 87卷
关键词
Phylogenetic networks; Level-1; Cut edge transfer; Semi-directed networks; 05C90; 92D15;
D O I
暂无
中图分类号
学科分类号
摘要
Semi-directed phylogenetic networks have recently emerged as a class of phylogenetic networks sitting between rooted (directed) and unrooted (undirected) phylogenetic networks as they contain both directed as well as undirected edges. While various spaces of rooted phylogenetic networks and unrooted phylogenetic networks have been analyzed in recent years and several rearrangement moves to traverse these spaces have been introduced, little is known about spaces of semi-directed phylogenetic networks. Here, we propose a simple rearrangement move for semi-directed phylogenetic networks, called cut edge transfer (CET), and show that the space of semi-directed level-1 networks with precisely k reticulations is connected under CET. This level-1 space is currently the predominantly used search space for most algorithms that reconstruct semi-directed phylogenetic networks. Our results imply that every semi-directed level-1 network with a fixed number of reticulations and leaf set can be reached from any other such network by a sequence of CETs. By introducing two additional moves, R+\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^+$$\end{document} and R-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^-$$\end{document}, that allow for the addition and deletion, respectively, of a reticulation, we then establish connectedness for the space of all semi-directed level-1 networks on a fixed leaf set. As a byproduct of our results for semi-directed phylogenetic networks, we also show that the space of rooted level-1 networks with a fixed number of reticulations and leaf set is connected under CET, when translated into the rooted setting.
引用
收藏
相关论文
共 50 条
  • [31] The LHCb Level-1 Trigger
    Schietinger, T.
    EUROPEAN PHYSICAL JOURNAL C, 2004, 34 (Suppl 1): : S419 - S423
  • [32] On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters
    Philippe Gambette
    K. T. Huber
    S. Kelk
    Journal of Mathematical Biology, 2017, 74 : 1729 - 1751
  • [33] First-passage percolation, semi-directed Bernoulli percolation and failure in brittle materials
    Berlyand, L
    Rintoul, MD
    Torquato, S
    JOURNAL OF STATISTICAL PHYSICS, 1998, 91 (3-4) : 603 - 623
  • [34] First-Passage Percolation, Semi-Directed Bernoulli Percolation, and Failure in Brittle Materials
    L. Berlyand
    M. D. Rintoul
    S. Torquato
    Journal of Statistical Physics, 1998, 91 : 603 - 623
  • [35] Piano Together, Level-1
    不详
    CLAVIER, 1998, 37 (02): : 38 - 38
  • [36] CMS level-1 trigger
    Wrochna, G
    NUCLEAR INSTRUMENTS & METHODS IN PHYSICS RESEARCH SECTION A-ACCELERATORS SPECTROMETERS DETECTORS AND ASSOCIATED EQUIPMENT, 1996, 384 (01): : 143 - 146
  • [37] THE LEVEL-1 FLUID WARMER
    NOLAN, JP
    DOW, AAC
    ANAESTHESIA, 1991, 46 (04) : 318 - 319
  • [38] Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets
    Katharina T. Huber
    Leo van Iersel
    Vincent Moulton
    Celine Scornavacca
    Taoyang Wu
    Algorithmica, 2017, 77 : 173 - 200
  • [39] Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes
    Gross, Elizabeth
    van Iersel, Leo
    Janssen, Remie
    Jones, Mark
    Long, Colby
    Murakami, Yukihiro
    JOURNAL OF MATHEMATICAL BIOLOGY, 2021, 83 (03)
  • [40] Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets
    Huber, Katharina T.
    van Iersel, Leo
    Moulton, Vincent
    Scornavacca, Celine
    Wu, Taoyang
    ALGORITHMICA, 2017, 77 (01) : 173 - 200