Advancing divide-and-conquer phylogeny estimation using Robinson-Foulds supertrees

DOI10.4230/LIPICS.WABI.2020.15zbMath1518.92103MaRDI QIDQ6487649

Sarah Christensen, Erin K. Molloy, T.-H. Le, Xilin Yu, Tandy J. Warnow

Publication date: 7 February 2023

zbMATH Keywords

divide-and-conquersupertreesphylogeny estimation

Mathematics Subject Classification ID

Problems related to evolution (92D15) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of phylogenetic trees
• A supertree method for rooted trees
• Phylogenetic supertrees. Combining information to reveal the tree of life
• A few logs suffice to build (almost) all trees. II
• Bioinformatics and phylogenetics. Seminal contributions of Bernard Moret
• Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
• Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
• A few logs suffice to build (almost) all trees (I)
• Fixed-Parameter Algorithms for Finding Agreement Supertrees
• Combinatorial Pattern Matching
• The asymmetric median tree. --- A new model for building consensus trees

This page was built for publication: Advancing divide-and-conquer phylogeny estimation using Robinson-Foulds supertrees