Clustering Systems of Phylogenetic Networks

Authors Marc Hellmuth, David Schaller, Peter F. Stadler

Publication date 28 April 2022

Abstract: Rooted acyclic graphs appear naturally when the phylogenetic relationship of a set

X

of taxa involves not only speciations but also recombination, horizontal transfer, or hybridization, that cannot be captured by trees. A variety of classes of such networks have been discussed in the literature, including phylogenetic, level-1, tree-child, tree-based, galled tree, regular, or normal networks as models of different types of evolutionary processes. Clusters arise in models of phylogeny as the sets

m a t h t t C (v)

of descendant taxa of a vertex

v

. The clustering system

m a t h s c r C_{N}

comprising the clusters of a network

N

conveys key information on

N

itself. In the special case of rooted phylogenetic trees,

T

is uniquely determined by its clustering system

m a t h s c r C_{T}

. Although this is no longer true for networks in general, it is of interest to relate properties of

N

and

m a t h s c r C_{N}

. Here, we systematically investigate the relationships of several well-studied classes of networks and their clustering systems. The main results are correspondences of classes of networks and clustering system of the following form: If

N

is a network of type

m a t h b b X

, then

m a t h c a l C_{N}

satisfies

m a t h b b Y

, and conversely if

m a t h s c r C

is a clustering system satisfying

m a t h b b Y

then there is network

N

of type

m a t h b b X

such that

m a t h s c r C s u b s e t e q m a t h s c r C_{N}

.This, in turn, allows us to investigate the mutual dependencies between the distinct types of networks in much detail.

This page was built for publication: Clustering Systems of Phylogenetic Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6397710)