Abstract

Phylogenetic networks are rooted, labelled directed acyclic graphs which are commonly used to represent reticulate evolution. There is a close relationship between phylogenetic networks and multi-labelled trees (MUL-trees). Indeed, any phylogenetic network NN can be 'unfolded' to obtain a MUL-tree U(N)U(N) and, conversely, a MUL-tree TT can in certain circumstances be 'folded' to obtain a phylogenetic network F(T)F(T) that exhibits TT. In this paper, we study properties of the operations UU and FF in more detail. In particular, we introduce the class of stable networks, phylogenetic networks NN for which F(U(N))F(U(N)) is isomorphic to NN, characterise such networks, and show that that they are related to the well-known class of tree-sibling networks. We also explore how the concept of displaying a tree in a network NN can be related to displaying the tree in the MUL-tree U(N)U(N). To do this, we develop a phylogenetic analogue of graph fibrations. This allows us to view U(N)U(N) as the analogue of the universal cover of a digraph, and to establish a close connection between displaying trees in U(N)U(N) and reconciling phylogenetic trees with networks.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.