Constructing the maximum consensus tree from rooted Triples

DOI10.1023/B:JOCO.0000021936.04215.68zbMath1058.90071OpenAlexW2065746563MaRDI QIDQ1768596

Bang Ye Wu

Publication date: 15 March 2005

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:joco.0000021936.04215.68

zbMATH Keywords

algorithmsdynamic programmingevolutionary treescomputational biologyNP-hardness

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (12)

Encoding and constructing 1-nested phylogenetic networks with trinets ⋮ Inferring a level-1 phylogenetic network from a dense set of rooted triplets ⋮ The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets ⋮ Kernel and fast algorithm for dense triplet inconsistency ⋮ Building a small and informative phylogenetic supertree ⋮ Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees ⋮ The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets ⋮ New heuristics for rooted triplet consistency ⋮ Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks ⋮ New results on optimizing rooted triplets consistency ⋮ Unnamed Item ⋮ NCHB: a method for constructing rooted phylogenetic networks from rooted triplets based on height function and binarization

This page was built for publication: Constructing the maximum consensus tree from rooted Triples