On the weighted quartet consensus problem

DOI10.1016/j.tcs.2018.10.005zbMath1422.68085arXiv1610.00505OpenAlexW3001537121WikidataQ129133903 ScholiaQ129133903MaRDI QIDQ1737590

Celine Scornavacca, Manuel Lafond

Publication date: 23 April 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.00505

zbMATH Keywords

bioinformaticsapproximation algorithmsNP-hardnessderandomizationphylogenetic tree

Mathematics Subject Classification ID

Problems related to evolution (92D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

A bound on partitioning clusters ⋮ The large-sample asymptotic behaviour of quartet-based summary methods for species tree inference

Uses Software

• ASTRAL-II

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparing and aggregating partially resolved trees
• New results on optimizing rooted triplets consistency
• Consensus n-trees
• The complexity of reconstructing trees from qualitative characters and subtrees
• Cyclic ordering is NP-complete
• Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
• The median procedure for n-trees
• New fixed-parameter algorithms for the minimum quartet inconsistency problem
• Constructing Optimal Trees from Quartets
• A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application
• Basic Phylogenetic Combinatorics
• A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
• Comparing and Aggregating Partially Resolved Trees

This page was built for publication: On the weighted quartet consensus problem