Quarnet inference rules for level-1 networks

11/17/2017
by   Katharine T. Huber, et al.
0

An important problem in phylogenetics is the construction of phylogenetic trees. One way to approach this problem, known as the supertree method, involves inferring a phylogenetic tree with leaves consisting of a set X of species from a collection of trees, each having leaf-set some subset of X. In the 1980's characterizations, certain inference rules were given for when a collection of 4-leaved trees, one for each 4-element subset of X, can all be simultaneously displayed by a single supertree with leaf-set X. Recently, it has become of interest to extend such results to phylogenetic networks. These are a generalization of phylogenetic trees which can be used to represent reticulate evolution (where species can come together to form a new species). It has been shown that a certain type of phylogenetic network, called a level-1 network, can essentially be constructed from 4-leaved trees. However, the problem of providing appropriate inference rules for such networks remains unresolved. Here we show that by considering 4-leaved networks, called quarnets, as opposed to 4-leaved trees, it is possible to provide such rules. In particular, we show that these rules can be used to characterize when a collection of quarnets, one for each 4-element subset of X, can all be simultaneously displayed by a level-1 network with leaf-set X. The rules are an intriguing mixture of tree inference rules, and an inference rule for building up a cyclic ordering of X from orderings on subsets of X of size 4. This opens up several new directions of research for inferring phylogenetic networks from smaller ones, which could yield new algorithms for solving the supernetwork problem in phylogenetics.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/16/2019

NANUQ: A method for inferring species networks from gene trees under the coalescent model

Species networks generalize the notion of species trees to allow for hyb...
research
05/06/2022

The Tree of Blobs of a Species Network: Identifiability under the Coalescent

Inference of species networks from genomic data under the Network Multis...
research
04/28/2014

Data Requirement for Phylogenetic Inference from Multiple Loci: A New Distance Method

We consider the problem of estimating the evolutionary history of a set ...
research
06/17/2016

Adding Context to Concept Trees

Concept Trees are a type of database that can organise arbitrary textual...
research
09/01/2023

Approximate Bayesian computation for Markovian binary trees in phylogenetics

Phylogenetic trees describe the relationships between species in the evo...
research
05/04/2019

New reduction rules for the tree bisection and reconnection distance

Recently it was shown that, if the subtree and chain reduction rules hav...

Please sign up or login with your details

Forgot password? Click here to reset