A universal tree-based network with the minimum number of reticulations

DOI10.1016/j.dam.2018.05.010zbMath1398.05186arXiv1707.08274OpenAlexW2963852331WikidataQ129758048 ScholiaQ129758048MaRDI QIDQ1801081

Charles Semple, Magnus Bordewich

Publication date: 26 October 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.08274

zbMATH Keywords

phylogenetic networkbase treeuniversal tree-based network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Problems related to evolution (92D15) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Classes of explicit phylogenetic networks and their biological and mathematical significance, Non-binary universal tree-based networks, The agreement distance of unrooted phylogenetic networks, When is a phylogenetic network simply an amalgamation of two trees?, A Structure Theorem for Rooted Binary Phylogenetic Networks and Its Implications for Tree-Based Networks, Phylogenetic networks that are their own fold-ups

Cites Work

• Unnamed Item
• Phylogenetic networks with every embedded phylogenetic tree a base tree
• On the existence of infinitely many universal tree-based networks
• On determining if tree-based networks contain fixed trees
• Permutation Groups, Complexes, and Rearrangeable Connecting Networks
• Optimal Rearrangeable Multistage Connecting Networks