The agreement distance of rooted phylogenetic networks

06/15/2018
by   Jonathan Klawitter, et al.
0

The minimal number of rooted subtree prune and regraft (rSPR) operations needed to transform one phylogenetic tree into another one induces a metric on phylogenetic trees - the rSPR-distance. The rSPR-distance between two phylogenetic trees T and T' can be characterised by a maximum agreement forest; a forest with a minimal number of components that covers both T and T'. The rSPR operation has recently been generalised to phylogenetic networks, among others, with the subnetwork prune and regraft (SNPR) operation. Here, we introduce maximum agreement graphs as an explicit representations of differences of two phylogenetic networks, thus generalising maximum agreement forests. We show that maximum agreement graphs induce a metric on phylogenetic networks - the agreement distance. While this metric does not characterise the distances induced by SNPR and other generalisations of rSPR, we prove that it still bounds these distances with constant factors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/22/2019

The agreement distance of unrooted phylogenetic networks

A rearrangement operation makes a small graph-theoretical change to a ph...
research
09/21/2016

Fast and reliable stereopsis measurement at multiple distances with iPad

Purpose: To present a new fast and reliable application for iPad (ST) fo...
research
12/17/2018

On the Extremal Maximum Agreement Subtree Problem

Given two phylogenetic trees with the {1, ..., n} leaf-set the maximum a...
research
02/22/2020

Testing the Agreement of Trees with Internal Labels

The input to the agreement problem is a collection P = {T_1, T_2, ... , ...
research
04/28/2023

Finding agreement cherry-reduced subnetworks in level-1 networks

Phylogenetic networks are increasingly being considered as better suited...
research
12/12/2017

Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies

Throughout the last decade, we have seen much progress towards character...
research
07/27/2020

Robust Similarity and Distance Learning via Decision Forests

Canonical distances such as Euclidean distance often fail to capture the...

Please sign up or login with your details

Forgot password? Click here to reset