New results on optimizing rooted triplets consistency
type: Item
instance of: scholarly article
title: New results on optimizing rooted triplets consistency
zbMATH Open document ID: 1221.05041
author: Jaroslaw Byrka
author: Sylvain Guillemot
author: Jesper Jansson
published in: Discrete Applied Mathematics
publication date: 2010-10-11T00:00:00Z
full work available at URL: 51c.pdf
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5798507
zbMATH Keywords: phylogenetic tree
zbMATH Keywords: rooted triplet
zbMATH Keywords: supertree
zbMATH Keywords: approximation algorithm
zbMATH Keywords: pseudorandomness
zbMATH Keywords: hardness of approximation
MaRDI profile type: Publication
OpenAlex ID: W2036921810
cites work: Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
cites work: Hardness of fully dense problems
cites work: Ranking Tournaments
cites work: Algorithmic construction of sets for k -restrictions
cites work: Maximum agreement and compatible supertrees
cites work: Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
cites work: Analytic solutions for three taxon ML trees with variable rates across sites
cites work: Q4503944
cites work: Q4198056
cites work: Q4953346
cites work: On the complexity of constructing evolutionary trees
cites work: Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
cites work: Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets
cites work: Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
cites work: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
cites work: Rooted maximum agreement supertrees
cites work: Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
cites work: Inferring a level-1 phylogenetic network from a dense set of rooted triplets
cites work: A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
cites work: Determining the Evolutionary Tree Using Experiments
cites work: Reconstruction of rooted trees from subtrees
cites work: Q4410170
cites work: Q4527015
cites work: A supertree method for rooted trees
cites work: The complexity of reconstructing trees from qualitative characters and subtrees
cites work: Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
cites work: Constructing the maximum consensus tree from rooted Triples
cites work: Q3002782
DOI: 10.1016/J.DAM.2010.03.004
description: scientific article; zbMATH DE number 5798507