Efficiently Inferring Pairwise Subtree Prune-and-Regraft Adjacencies between Phylogenetic Trees

DOI10.1137/1.9781611975062.8zbMath1435.92047arXiv1606.08893OpenAlexW2964319183MaRDI QIDQ5195108

Frederick A. IV Matsen, Chris Whidden

Publication date: 18 September 2019

Published in: 2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

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

zbMATH Keywords

phylogenetic treestime-optimal algorithmsubtree prune-regraft graph

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90) Algorithms on strings (68W32)

Related Items (5)

Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph ⋮ Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks ⋮ On the subnet prune and regraft distance ⋮ AFContainer ⋮ SDLNewick

Uses Software

• RAxML
• PAUP*
• BEAST

This page was built for publication: Efficiently Inferring Pairwise Subtree Prune-and-Regraft Adjacencies between Phylogenetic Trees