The agreement distance of rooted phylogenetic networks
From MaRDI portal
Publication:5226840
zbMATH Open1417.05232arXiv1806.05800MaRDI QIDQ5226840FDOQ5226840
Authors: Jonathan Klawitter
Publication date: 1 August 2019
Abstract: 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 and can be characterised by a maximum agreement forest; a forest with a minimum number of components that covers both and . The rSPR operation has recently been generalised to phylogenetic networks with, among others, 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.
Full work available at URL: https://arxiv.org/abs/1806.05800
Recommendations
Cited In (5)
- Heading in the right direction? Using head moves to traverse phylogenetic network space
- On agreement forests
- Computing the rooted triplet distance between phylogenetic networks
- Phylogenetic network dissimilarity measures that take branch lengths into account
- The agreement distance of unrooted phylogenetic networks
This page was built for publication: The agreement distance of rooted phylogenetic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226840)