Classification of Phylogenetic Networks
Anastasios Stefanou · arXiv (Cornell University) · 2019
By considering rooted Reeb graphs as a model for phylogenetic networks, using tools from category theory we construct an injection that assigns to each phylogenetic network with $n$-labelled leaves and $s$ cycles a finite set of phylogenetic trees with $(n+s)$-labelled leaves. In particular, we show this map is canonical, i.e. it classifies phylogenetic networks up to isomorphism. Finally we discuss some upper bounds for the isomorphism complexity of these networks.