Extremal distances for subtree transfer operations in binary trees
From MaRDI portal
Publication:2421307
DOI10.1007/s00026-018-0410-4zbMath1414.05074arXiv1509.00669OpenAlexW2963358354WikidataQ128750113 ScholiaQ128750113MaRDI QIDQ2421307
Ross Atkins, Colin J. H. McDiarmid
Publication date: 14 June 2019
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.00669
binary treephylogenetic treesubtree prune and regraftagreement foresttree rearrangementaverage distanceextremal distancetree bisection and reconnection
Trees (05C05) Problems related to evolution (92D15) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph ⋮ Deep kernelization for the tree bisection and reconnection (TBR) distance in phylogenetics ⋮ Lagged couplings diagnose Markov chain Monte Carlo phylogenetic inference ⋮ Ranked subtree prune and regraft ⋮ New reduction rules for the tree bisection and reconnection distance ⋮ Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm ⋮ Exploring the tiers of rooted phylogenetic network space using tail moves ⋮ Reflections on kernelizing and computing unrooted agreement forests
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On agreement forests
- Reconstructing evolution of sequences subject to recombination using parsimony
- Note on the hybridization number and subtree distance in phylogenetics
- On the computational complexity of the rooted subtree prune and regraft distance
- Does random tree puzzle produce Yule-Harding trees in the many-taxon limit?
- The maximum agreement subtree problem
- Bounds on the Expected Size of the Maximum Agreement Subtree
- Subtree transfer operations and their induced metrics on evolutionary trees
- On the complexity of comparing evolutionary trees
