Restricted trees: simplifying networks with bottlenecks

DOI10.1007/S11538-010-9624-2zbMATH Open1334.92301arXiv1005.4956OpenAlexW2098880083WikidataQ45678762 ScholiaQ45678762MaRDI QIDQ263741FDOQ263741

Authors: Stephen J. Willson 

Publication date: 5 April 2016

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

Abstract: Suppose N is a phylogenetic network indicating a complicated relationship among individuals and taxa. Often of interest is a much simpler network, for example, a species tree T, that summarizes the most fundamental relationships. The meaning of a species tree is made more complicated by the recent discovery of the importance of hybridizations and lateral gene transfers. Hence it is desirable to describe uniform well-defined procedures that yield a tree given a network N. A useful tool toward this end is a connected surjective digraph (CSD) map f from N to N' where N' is generally a much simpler network than N. A set W of vertices in N is "restricted" if there is at most one vertex from which there is an arc into W, thus yielding a bottleneck in N. A CSD map f from N to N' is "restricted" if the inverse image of each vertex in N' is restricted in N. This paper describes a uniform procedure that, given a network N, yields a well-defined tree called the "restricted tree" of N. There is a restricted CSD map from N to the restricted tree. Many relationships in the tree can be proved to appear also in N.

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

Recommendations

• Tree-based unrooted phylogenetic networks
• Phylogenetic networks from multi-labelled trees
• Distinct-cluster tree-child phylogenetic networks and possible uses to study polyploidy
• Constructing the Simplest Possible Phylogenetic Network from Triplets
• Constructing the simplest possible phylogenetic network from triplets

zbMATH Keywords

treenetworkphylogenyconnecteddigraphhomomorphismhybridphylogenetic networkrestricted

Mathematics Subject Classification ID

Applications of graph theory (05C90) Problems related to evolution (92D15)

Cites Work

• Title not available (Why is that?)
• A framework for representing reticulate evolution
• The fine structure of galls in phylogenetic networks

Cited In (2)

• Contours and tight clusters
• Interdicting facilities in tree networks

This page was built for publication: Restricted trees: simplifying networks with bottlenecks

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