Building a small and informative phylogenetic supertree

DOI10.1016/j.ic.2023.105082MaRDI QIDQ6077843

T. P. Sandhya, Jesper Jansson, Konstantinos Mampentzidis

Publication date: 27 September 2023

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

consistencyapproximation algorithmphylogenetic treesupertreerooted triplet

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New results on optimizing rooted triplets consistency
• Rooted maximum agreement supertrees
• Analytic solutions for three taxon ML trees with variable rates across sites
• Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
• On the complexity of constructing evolutionary trees
• New local search approximation techniques for maximum generalized satisfiability problems
• Parallel approximation algorithms by positive linear programming
• Distributions of cherries for two models of trees
• Constructing the maximum consensus tree from rooted Triples
• Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
• Maximum agreement and compatible supertrees
• The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree
• The Design of Approximation Algorithms
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
• Cache Oblivious Algorithms for Computing the Triplet Distance between Trees
• Some optimal inapproximability results
• Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree