A cluster reduction for computing the subtree distance between phylogenies

DOI10.1007/s00026-011-0108-3zbMath1234.05057OpenAlexW2132762477MaRDI QIDQ659644

Simone Linz, Charles Semple

Publication date: 24 January 2012

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

Full work available at URL: http://hdl.handle.net/10092/12531

zbMATH Keywords

phylogenetic treecluster reductiondivide-and-conquer approachrooted subtree prune and regraftrSPR

Mathematics Subject Classification ID

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

Related Items (8)

Treewidth distance on phylogenetic trees ⋮ New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees ⋮ Gene tree reconciliation including transfers with replacement is NP-hard and FPT ⋮ Ranked subtree prune and regraft ⋮ On the fixed parameter tractability of agreement-based phylogenetic distances ⋮ Computing Maximum Agreement Forests without Cluster Partitioning is Folly ⋮ On the maximum parsimony distance between phylogenetic trees ⋮ A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees

Cites Work

• A framework for representing reticulate evolution
• On the computational complexity of the rooted subtree prune and regraft distance
• Bounding the number of hybridisation events for a consistent evolutionary history
• Subtree transfer operations and their induced metrics on evolutionary trees

This page was built for publication: A cluster reduction for computing the subtree distance between phylogenies