The agreement distance of unrooted phylogenetic networks
From MaRDI portal
Publication:3386619
DOI10.23638/DMTCS-22-1-22zbMath1454.05118arXiv1908.08183MaRDI QIDQ3386619
Publication date: 5 January 2021
Full work available at URL: https://arxiv.org/abs/1908.08183
Problems related to evolution (92D15) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (05C99) Systems biology, networks (92C42)
Related Items (2)
Orchard networks are trees with additional horizontal arcs ⋮ Exploring spaces of semi-directed level-1 networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
- On the fixed parameter tractability of agreement-based phylogenetic distances
- A 3-approximation algorithm for the subtree distance between phylogenies
- The maximum agreement forest problem: Approximation algorithms and computational experiments
- On the subnet prune and regraft distance
- Bounds for phylogenetic network space metrics
- Tree-based unrooted phylogenetic networks
- On the computational complexity of the rooted subtree prune and regraft distance
- Exploring the tiers of rooted phylogenetic network space using tail moves
- A universal tree-based network with the minimum number of reticulations
- Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks
- A faster FPT algorithm for the maximum agreement forest problem
- Phylogeny
- Graph Theory
- Fixed-Parameter Algorithms for Maximum Agreement Forests
- Efficiently Calculating Evolutionary Tree Measures Using SAT
- Rearrangement operations on unrooted phylogenetic networks
- The agreement distance of rooted phylogenetic networks
- Subtree transfer operations and their induced metrics on evolutionary trees
This page was built for publication: The agreement distance of unrooted phylogenetic networks
