Unrooted non-binary tree-based phylogenetic networks

DOI10.1016/J.DAM.2021.01.005zbMATH Open1459.05042arXiv1810.06853OpenAlexW3130461072MaRDI QIDQ2656952FDOQ2656952

Authors: Mareike Fischer, Lina Herbst, Michelle Galla, Yangjing Long, Kristina Wicke 

Publication date: 17 March 2021

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

Abstract: Phylogenetic networks are a generalization of phylogenetic trees allowing for the representation of non-treelike evolutionary events such as hybridization. Typically, such networks have been analyzed based on their `level', i.e. based on the complexity of their 2-edge-connected components. However, recently the question of how `treelike' a phylogenetic network is has become the center of attention in various studies. This led to the introduction of emph{tree-based networks}, i.e. networks that can be constructed from a phylogenetic tree, called the emph{base tree}, by adding additional edges. While the concept of tree-basedness was originally introduced for rooted phylogenetic networks, it has recently also been considered for unrooted networks. In the present study, we compare and contrast findings obtained for unrooted emph{binary} tree-based networks to unrooted emph{non-binary} networks. In particular, while it is known that up to level 4 all unrooted binary networks are tree-based, we show that in the case of non-binary networks, this result only holds up to level 3.

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

Recommendations

• Tree-based unrooted nonbinary phylogenetic networks
• Tree-based unrooted phylogenetic networks
• Non-binary universal tree-based networks
• How tree-based is my network? Proximity measures for unrooted phylogenetic networks
• Tree-based networks: characterisations, metrics, and support trees

zbMATH Keywords

phylogenetic treeHamiltonian pathphylogenetic networktree-based networklevel-\(k\) network

Mathematics Subject Classification ID

Applications of graph theory (05C90) Problems related to evolution (92D15) Trees (05C05) Systems biology, networks (92C42) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• House of Graphs: a database of interesting graphs
• Spanning trees with small degrees and few leaves
• On finding spanning trees with few leaves
• On longest paths and circuits in graphs.
• Tree-based unrooted phylogenetic networks
• Computing the maximum agreement of phylogenetic networks
• Spanning trees with few leaves
• Title not available (Why is that?)
• Research in Computational Molecular Biology
• Title not available (Why is that?)
• Tree-based unrooted nonbinary phylogenetic networks

Cited In (10)

• Tree-based unrooted nonbinary phylogenetic networks
• Identifiability of local and global features of phylogenetic networks from average distances
• On unrooted and root-uncertain variants of several well-known phylogenetic network problems
• How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks
• Nonbifurcating Phylogenetic Tree Inference via the Adaptive LASSO
• Uprooted phylogenetic networks
• A method for numbering binary rooted and unrooted phylogenies and their hypothetical taxonomic units
• Tree-based unrooted phylogenetic networks
• Correction to: ``Tree-based unrooted phylogenetic networks
• A Structure Theorem for Rooted Binary Phylogenetic Networks and Its Implications for Tree-Based Networks

Uses Software

• House of Graphs

This page was built for publication: Unrooted non-binary tree-based phylogenetic networks

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