Transformations to simplify phylogenetic networks
Johanna Heiss, Daniel H. Huson, Mike Steel

TL;DR
This paper investigates methods for transforming complex phylogenetic networks into simpler trees, focusing on a consistency condition, and finds that the LSA tree method uniquely satisfies this property among several approaches.
Contribution
The paper introduces and analyzes the consistency condition for network-to-tree transformations and identifies the LSA tree method as the only method satisfying this criterion.
Findings
LSA tree method satisfies the consistency condition.
Several common methods do not satisfy the consistency condition.
Introduction of a new method that also does not satisfy the condition.
Abstract
The evolutionary relationships between species are typically represented in the biological literature by rooted phylogenetic trees. However, a tree fails to capture ancestral reticulate processes, such as the formation of hybrid species or lateral gene transfer events between lineages, and so the history of life is more accurately described by a rooted phylogenetic network. Nevertheless, phylogenetic networks may be complex and difficult to interpret, so biologists sometimes prefer a tree that summarises the central tree-like trend of evolution. In this paper, we formally investigate methods for transforming an arbitrary phylogenetic network into a tree (on the same set of leaves) and ask which ones (if any) satisfy a simple consistency condition. This consistency condition states that if we add additional species into a phylogenetic network (without otherwise changing this original…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBiomedical Text Mining and Ontologies · Evolution and Paleontology Studies
MethodsSparse Evolutionary Training
