Bounds on the size of the TBR unit-neighbourhood

DOI10.1007/S00026-011-0072-YMaRDI QIDQ659604zbMATH OpenOpenAlexFDO

Authors Peter J. Humphries

Publication date 24 January 2012

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

Full work available at URL https://doi.org/10.1007/s00026-011-0072-y

zbMATH Keywords

tree bisection and reconnection (TBR)unit-neighbourhoodunrooted trees

Mathematics Subject Classification ID

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

Recommendations

• On the combinatorics of rooted binary phylogenetic trees
• Neighborhoods of trees in circular orderings
• Subtree transfer operations and their induced metrics on evolutionary trees
• New reduction rules for the tree bisection and reconnection distance
• Neighborhoods of phylogenetic trees: exact and asymptotic counts

Cites work

• On the combinatorics of rooted binary phylogenetic trees
• Subtree transfer operations and their induced metrics on evolutionary trees

This page was built for publication: Bounds on the size of the TBR unit-neighbourhood

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