Labellable phylogenetic networks

Andrew Francis; Mike Steel

doi:10.1007/s11538-023-01157-0

Labellable phylogenetic networks

Andrew Francis, Mike Steel

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

Abstract

Phylogenetic networks are mathematical representations of evolutionary history that are able to capture both tree-like evolutionary processes (speciations) and non-tree-like 'reticulate' processes such as hybridization or horizontal gene transfer. The additional complexity that comes with this capacity, however, makes networks harder to infer from data, and more complicated to work with as mathematical objects. In this paper, we define a new, large class of phylogenetic networks, that we call labellable, and show that they are in bijection with the set of 'expanding covers' of finite sets. This correspondence is a generalisation of the encoding of phylogenetic forests by partitions of finite sets. Labellable networks can be characterised by a simple combinatorial condition, and we describe the relationship between this large class and other commonly studied classes. Furthermore, we show that all phylogenetic networks have a quotient network that is labellable.

Original language	English
Article number	46
Number of pages	18
Journal	Bulletin of Mathematical Biology
Volume	85
Issue number	6
DOIs	https://doi.org/10.1007/s11538-023-01157-0
Publication status	Published - Jun 2023

Bibliographical note

Publisher Copyright:
© 2023, The Author(s).

Open Access - Access Right Statement

This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.

Keywords

Phylogenetic network
Orchard
Encoding
Tree-based

Access to Document

10.1007/s11538-023-01157-0

Cite this

@article{e415b0233df34f5c9968d9d353135aac,

title = "Labellable phylogenetic networks",

abstract = "Phylogenetic networks are mathematical representations of evolutionary history that are able to capture both tree-like evolutionary processes (speciations) and non-tree-like 'reticulate' processes such as hybridization or horizontal gene transfer. The additional complexity that comes with this capacity, however, makes networks harder to infer from data, and more complicated to work with as mathematical objects. In this paper, we define a new, large class of phylogenetic networks, that we call labellable, and show that they are in bijection with the set of 'expanding covers' of finite sets. This correspondence is a generalisation of the encoding of phylogenetic forests by partitions of finite sets. Labellable networks can be characterised by a simple combinatorial condition, and we describe the relationship between this large class and other commonly studied classes. Furthermore, we show that all phylogenetic networks have a quotient network that is labellable.",

keywords = "Phylogenetic network, Orchard, Encoding, Tree-based",

author = "Andrew Francis and Mike Steel",

note = "Publisher Copyright: {\textcopyright} 2023, The Author(s).",

year = "2023",

month = jun,

doi = "10.1007/s11538-023-01157-0",

language = "English",

volume = "85",

journal = "Bulletin of Mathematical Biology",

issn = "0092-8240",

publisher = "Springer",

number = "6",

}

TY - JOUR

T1 - Labellable phylogenetic networks

AU - Francis, Andrew

AU - Steel, Mike

PY - 2023/6

Y1 - 2023/6

N2 - Phylogenetic networks are mathematical representations of evolutionary history that are able to capture both tree-like evolutionary processes (speciations) and non-tree-like 'reticulate' processes such as hybridization or horizontal gene transfer. The additional complexity that comes with this capacity, however, makes networks harder to infer from data, and more complicated to work with as mathematical objects. In this paper, we define a new, large class of phylogenetic networks, that we call labellable, and show that they are in bijection with the set of 'expanding covers' of finite sets. This correspondence is a generalisation of the encoding of phylogenetic forests by partitions of finite sets. Labellable networks can be characterised by a simple combinatorial condition, and we describe the relationship between this large class and other commonly studied classes. Furthermore, we show that all phylogenetic networks have a quotient network that is labellable.

AB - Phylogenetic networks are mathematical representations of evolutionary history that are able to capture both tree-like evolutionary processes (speciations) and non-tree-like 'reticulate' processes such as hybridization or horizontal gene transfer. The additional complexity that comes with this capacity, however, makes networks harder to infer from data, and more complicated to work with as mathematical objects. In this paper, we define a new, large class of phylogenetic networks, that we call labellable, and show that they are in bijection with the set of 'expanding covers' of finite sets. This correspondence is a generalisation of the encoding of phylogenetic forests by partitions of finite sets. Labellable networks can be characterised by a simple combinatorial condition, and we describe the relationship between this large class and other commonly studied classes. Furthermore, we show that all phylogenetic networks have a quotient network that is labellable.

KW - Phylogenetic network

KW - Orchard

KW - Encoding

KW - Tree-based

UR - https://hdl.handle.net/1959.7/uws:71840

UR - http://www.scopus.com/inward/record.url?scp=85153900953&partnerID=8YFLogxK

U2 - 10.1007/s11538-023-01157-0

DO - 10.1007/s11538-023-01157-0

M3 - Article

SN - 0092-8240

VL - 85

JO - Bulletin of Mathematical Biology

JF - Bulletin of Mathematical Biology

IS - 6

M1 - 46

ER -

Labellable phylogenetic networks

Abstract

Bibliographical note

Open Access - Access Right Statement

Keywords

Access to Document

Other files and links

Fingerprint

Cite this