New heuristics for rooted triplet consistency

DOI10.3390/a6030396zbMath1461.92065OpenAlexW2129484641MaRDI QIDQ1736566

Soheil Jahangiri, Seyed Naser Hashemi, Hadi Poormohammadi

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a6030396

zbMATH Keywords

approximation algorithmphylogenetic treerooted tripletconsensus tree

Mathematics Subject Classification ID

Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10) Genetics and epigenetics (92D10) Approximation algorithms (68W25)

Related Items

The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets ⋮ Editorial: Special issue on graph algorithms ⋮ NCHB: a method for constructing rooted phylogenetic networks from rooted triplets based on height function and binarization

Cites Work

• Unnamed Item
• Unnamed Item
• Rooted maximum agreement supertrees
• Inferring a level-1 phylogenetic network from a dense set of rooted triplets
• Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
• On the complexity of constructing evolutionary trees
• Constructing the maximum consensus tree from rooted Triples
• Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
• New Results on Optimizing Rooted Triplets Consistency
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
• Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites
• Determining the Evolutionary Tree Using Experiments
• Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity