The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
type: Item
instance of: scholarly article
title: The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
zbMATH Open document ID: 1406.05099
author: Katharina Dannenberg
author: Jesper Jansson
author: Andrzej Lingas
author: Eva-Marta Lundell
published in: Discrete Applied Mathematics
publication date: 2019-03-11T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 7034213
zbMATH Keywords: phylogenetic tree
zbMATH Keywords: rooted triplet
zbMATH Keywords: approximation algorithm
zbMATH Keywords: dynamic programming
zbMATH Keywords: smooth polynomial integer program
MaRDI profile type: Publication
full work available at URL: j.dam.2018.08.028
OpenAlex ID: W2899269379
cites work: Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
cites work: Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
cites work: Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
cites work: New results on optimizing rooted triplets consistency
cites work: Analytic solutions for three taxon ML trees with variable rates across sites
cites work: Q4198056
cites work: Q4953346
cites work: On the complexity of constructing evolutionary trees
cites work: Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
cites work: New heuristics for rooted triplet consistency
cites work: The complexity of inferring a minimally resolved phylogenetic supertree
cites work: A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
cites work: Reconstruction of rooted trees from subtrees
cites work: The complexity of reconstructing trees from qualitative characters and subtrees
cites work: Constructing the maximum consensus tree from rooted Triples
Wikidata QID: Q128977062
DOI: 10.1016/J.DAM.2018.08.028
description: scientific article; zbMATH DE number 7034213