Exploring spaces of semi-directed level-1 networks

• Published in: Journal of mathematical biology 2023-11, Vol.87 (5), p.70-70, Article 70
• Main Authors: Linz, Simone, Wicke, Kristina
• Format: Article
• Language: English
• Subjects: Algorithms; Applications of Mathematics; Leaves; Mathematical and Computational Biology; Mathematics; Mathematics and Statistics; Networks; Phylogenetics; Phylogeny
• ISSN: 0303-6812; 1432-1416
• DOI: 10.1007/s00285-023-02004-5

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 + and R - , 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.