Properties of subtree-prune-and-regraft operations on totally-ordered phylogenetic trees

DOI10.1007/S00026-006-0279-5MaRDI QIDQ2494464zbMATH OpenOpenAlexFDO

Authors Yun S. Song

Publication date 28 June 2006

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00026-006-0279-5

zbMATH Keywords

neighbourhoodordered treesrecombinationSPR

Mathematics Subject Classification ID

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

Recommendations

• On the combinatorics of rooted binary phylogenetic trees
• Subtree transfer operations and their induced metrics on evolutionary trees
• Neighborhoods of trees in circular orderings
• The SNPR neighbourhood of tree-child networks
• Extremal distances for subtree transfer operations in binary trees

Cited in

(11)

• On the combinatorics of rooted binary phylogenetic trees
• Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph
• Neighborhoods of trees in circular orderings
• Gene tree reconciliation including transfers with replacement is NP-hard and FPT
• The SNPR neighbourhood of tree-child networks
• Bridging trees for posterior inference on ancestral recombination graphs
• A Mathematical Connection Between Single-Elimination Sports Tournaments and Evolutionary Trees
• Ranked subtree prune and regraft
• Exact sampling of spanning trees via fast-forwarded random walks
• Labeled histories and maximally probable labeled topologies with multifurcation
• An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation

This page was built for publication: Properties of subtree-prune-and-regraft operations on totally-ordered phylogenetic trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494464)