Phylogenetic networks that are their own fold-ups

DOI10.1016/J.AAM.2019.101959zbMATH Open1429.05042arXiv1804.01841OpenAlexW2988706065WikidataQ126834702 ScholiaQ126834702MaRDI QIDQ2280359FDOQ2280359

Authors: Katharina T. Huber, G. E. Scholz 

Publication date: 18 December 2019

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Abstract: Phylogenetic networks are becoming of increasing interest to evolutionary biologists due to their ability to capture complex non-treelike evolutionary processes. From a combinatorial point of view, such networks are certain types of rooted directed acyclic graphs whose leaves are labelled by, for example, species. A number of mathematically interesting classes of phylogenetic networks are known. These include the biologically relevant class of stable phylogenetic networks whose members are defined via certain "fold-up" and "un-fold" operations that link them with concepts arising within the theory of, for example, graph fibrations. Despite this exciting link, the structural complexity of stable phylogenetic networks is still relatively poorly understood. Employing the popular tree-based, reticulation-visible, and tree-child properties which allow one to gauge this complexity in one way or another, we provide novel characterizations for when a stable phylogenetic network satisfies either one of these three properties.

Full work available at URL: https://arxiv.org/abs/1804.01841

Recommendations

• Folding and unfolding phylogenetic trees and networks
• Labellable phylogenetic networks
• Tree-based unrooted phylogenetic networks
• Binets: fundamental building blocks for phylogenetic networks
• When is a phylogenetic network simply an amalgamation of two trees?

zbMATH Keywords

phylogenetic networkreticulation-visible networktree-based networktree-child networkstable network

Mathematics Subject Classification ID

Applications of graph theory (05C90) Problems related to evolution (92D15) Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Transversal (matching) theory (05D15)

Cites Work

• Phylogeny. Discrete and random processes in evolution
• Title not available (Why is that?)
• Phylogenetic networks with every embedded phylogenetic tree a base tree
• Locating a tree in a phylogenetic network
• Locating a tree in a phylogenetic network in quadratic time
• Reticulation-visible networks
• On the existence of infinitely many universal tree-based networks
• ReCombinatorics. The algorithmics of ancestral recombination graphs and explicit phylogenetic networks. With contributions from Charles H. Langley, Yun S. Song and Yufeng Wu
• Phylogenetic networks from multi-labelled trees
• Folding and unfolding phylogenetic trees and networks
• Computing a consensus of multilabeled trees
• Trinets encode tree-child and level-2 phylogenetic networks
• Encoding and constructing 1-nested phylogenetic networks with trinets
• Constructing tree-child networks from distance matrices
• A decomposition theorem and two algorithms for reticulation-visible networks
• Generating functions for multi-labeled trees
• New characterisations of tree-based networks and proximity measures
• A universal tree-based network with the minimum number of reticulations

Cited In (10)

• Forest-based networks
• When is a phylogenetic network simply an amalgamation of two trees?
• Labellable phylogenetic networks
• Autopolyploidy, allopolyploidy, and phylogenetic networks with horizontal arcs
• Classes of explicit phylogenetic networks and their biological and mathematical significance
• Galois connections for phylogenetic networks and their polytopes
• Folding and unfolding phylogenetic trees and networks
• Phylogenetic network classes through the lens of expanding covers
• The hybrid number of a ploidy profile
• Phylogenetic networks that display a tree twice

Uses Software

• PADRE

This page was built for publication: Phylogenetic networks that are their own fold-ups

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