Ranked subtree prune and regraft

DOI10.1007/s11538-023-01244-2OpenAlexW4391404075WikidataQ128976088 ScholiaQ128976088MaRDI QIDQ6194022

Chris Whidden, Lena Collienne, Alex Gavryushkin

Publication date: 14 February 2024

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11538-023-01244-2

zbMATH Keywords

treespacephylogeneticsranked treestree distancetime treestree rearrangements

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15)

Cites Work

• The combinatorics of discrete time-trees: theory and open problems
• Computing nearest neighbour interchange distances between ranked phylogenetic trees
• Discrete coalescent trees
• Algorithmic improvements to species delimitation and phylogeny estimation under the multispecies coalescent
• On agreement forests
• A cluster reduction for computing the subtree distance between phylogenies
• On the combinatorics of rooted binary phylogenetic trees
• Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph
• On the computational complexity of the rooted subtree prune and regraft distance
• Extremal distances for subtree transfer operations in binary trees
• Properties of subtree-prune-and-regraft operations on totally-ordered phylogenetic trees
• Fixed-Parameter Algorithms for Maximum Agreement Forests
• Subtree transfer operations and their induced metrics on evolutionary trees

This page was built for publication: Ranked subtree prune and regraft