Computing nearest neighbour interchange distances between ranked phylogenetic trees

DOI10.1007/s00285-021-01567-5OpenAlexW3122154912WikidataQ113905581 ScholiaQ113905581MaRDI QIDQ96718

Lena Collienne, Alex Gavryushkin, Lena Collienne

Publication date: January 2021

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

Full work available at URL: https://arxiv.org/abs/2007.12307

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15)

Related Items (4)

Ranked subtree prune and regraft ⋮ Discrete coalescent trees ⋮ rrnni ⋮ treeOclock

Uses Software

• MrBayes
• RAxML
• MEGA
• PhyML
• BEAST
• rSPR
• SPRSupertrees
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• The combinatorics of discrete time-trees: theory and open problems
• The space of ultrametric phylogenetic trees
• Fundamentals of parameterized complexity
• On the linear-cost subtree-transfer distance between phylogenetic trees
• Comparison of 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
• New approaches in classification and data analysis
• Subtree transfer operations and their induced metrics on evolutionary trees
• On the complexity of comparing evolutionary trees

This page was built for publication: Computing nearest neighbour interchange distances between ranked phylogenetic trees