Tools
Tools
Hellmuth, Marc, Huber, Katharina T., Moulton, Vincent 
ORCID: https://orcid.org/0000-0001-9371-6435, Scholz, Guillaume E. and Stadler, Peter F.
(2023)
Injective split systems.
Graphs and Combinatorics, 39 (4).
ISSN 0911-0119
Preview |
PDF (Hellmuth_etal_2023_GaC)
- Published Version
Available under License Creative Commons Attribution. Download (441kB) | Preview |
Abstract
A split system $\mathcal S$ on a finite set $X$, $|X|\ge3$, is a set of bipartitions or splits of $X$ which contains all splits of the form $\{x,X-\{x\}\}$, $x \in X$. To any such split system $\mathcal S$ we can associate the Buneman graph $\mathcal B(\mathcal S)$ which is essentially a median graph with leaf-set $X$ that displays the splits in $\mathcal S$. In this paper, we consider properties of injective split systems, that is, split systems $\mathcal S$ with the property that $\med_{\mathcal B(\mathcal S)}(Y) \neq \med_{\mathcal B(\mathcal S)}(Y')$ for any 3-subsets $Y,Y'$ in $X$, where $\med_{\mathcal B(\mathcal S)}(Y)$ denotes the median in $\mathcal B(\mathcal S)$ of the three elements in $Y$ considered as leaves in $\mathcal B(\mathcal S)$. In particular, we show that for any set $X$ there always exists an injective split system on $X$, and we also give a characterization for when a split system is injective. We also consider how complex the Buneman graph $\mathcal B(\mathcal S)$ needs to become in order for a split system $\mathcal S$ on $X$ to be injective. We do this by introducing a quantity for $|X|$ which we call the injective dimension for $|X|$, as well as two related quantities, called the injective 2-split and the rooted-injective dimension. We derive some upper and lower bounds for all three of these dimensions and also prove that some of these bounds are tight. An underlying motivation for studying injective split systems is that they can be used to obtain a natural generalization of symbolic tree maps. An important consequence of our results is that any three-way symbolic map on $X$ can be represented using Buneman graphs.
| Item Type: | Article |
|---|---|
| Additional Information: | Acknowledgements: This work was supported in part by the German Federal Ministry for Education and Research (BMBF 031L0164C, RNAProNet, to P.F.S.). The authors would like to thank the Institut Mittag-Leffler in Djursholm, Sweden for hosting the conference “Emerging Mathematical Frontiers in Molecular Evolution” in August 2022, where this work was finalized. They also thank the two reviewers for their careful reading of the manuscript. Funding: Open Access funding enabled and organized by Projekt DEAL. This study was funded by Bundesministerium für Bildung und Forschung (No. BMBF 031L0164C). |
| Uncontrolled Keywords: | median graph,split system,buneman graph,split system,median graph,theoretical computer science,discrete mathematics and combinatorics ,/dk/atira/pure/subjectarea/asjc/2600/2614 |
| Faculty \ School: | Faculty of Science > School of Computing Sciences |
| UEA Research Groups: | Faculty of Science > Research Groups > Computational Biology Faculty of Science > Research Groups > Norwich Epidemiology Centre Faculty of Medicine and Health Sciences > Research Groups > Norwich Epidemiology Centre |
| Related URLs: | |
| Depositing User: | LivePure Connector |
| Date Deposited: | 02 May 2023 17:30 |
| Last Modified: | 19 Jun 2023 08:30 |
| URI: | https://ueaeprints.uea.ac.uk/id/eprint/91964 |
| DOI: | 10.1007/s00373-023-02660-w |
Downloads
Downloads per month over past year
Actions (login required)
 |
View Item |