On the subnet prune and regraft distance
From MaRDI portal
Publication:1740360
zbMath1411.05249arXiv1805.07839MaRDI QIDQ1740360
Simone Linz, Jonathan Klawitter
Publication date: 30 April 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.07839
Problems related to evolution (92D15) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10)
Related Items (2)
The agreement distance of unrooted phylogenetic networks ⋮ Heading in the right direction? Using head moves to traverse phylogenetic network space
Cites Work
- Unnamed Item
- Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees
- Transforming phylogenetic networks: moving beyond tree space
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
- Bounds for phylogenetic network space metrics
- On the computational complexity of the rooted subtree prune and regraft distance
- Exploring the tiers of rooted phylogenetic network space using tail moves
- Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks
- Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations
- The SNPR neighbourhood of tree-child networks
- Efficiently Inferring Pairwise Subtree Prune-and-Regraft Adjacencies between Phylogenetic Trees
- Subtree transfer operations and their induced metrics on evolutionary trees
This page was built for publication: On the subnet prune and regraft distance