Walks in phylogenetic treespace

DOI10.1016/j.ipl.2011.03.015zbMath1259.05176OpenAlexW2065659924MaRDI QIDQ1944961

Michael Hintze, John Dejesus, Diquan Moore, Katherine St. John, Alan Joseph J. Caceres, Samantha Daley

Publication date: 28 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.03.015

zbMATH Keywords

graph algorithmscomputational biologyphylogeneticstree metricsnearest neighbour interchangesubtree prune and regcrafttree bisection and reconnection

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A parsimony-based metric for phylogenetic trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A 3-approximation algorithm for the subtree distance between phylogenies
• The Steiner problem in phylogeny is NP-complete
• On the computational complexity of the rooted subtree prune and regraft distance
• Landscapes on spaces of trees
• Subtree transfer operations and their induced metrics on evolutionary trees

This page was built for publication: Walks in phylogenetic treespace