On the minimum quartet tree cost problem

07/02/2018
by   Sergio Consoli, et al.
0

Given a set of n data objects and their pairwise dissimilarities, the goal of the minimum quartet tree cost (MQTC) problem is to construct an optimal tree from the total number of possible combinations of quartet topologies on n, where optimality means that the sum of the dissimilarities of the embedded (or consistent) quartet topologies is minimal. We provide details and formulation of this novel challenging problem, and the preliminaries of an exact algorithm under current development which may be useful to improve the MQTC heuristics to date into more efficient hybrid approaches.

READ FULL TEXT

page 1

page 2

page 3

research
06/11/2006

A New Quartet Tree Heuristic for Hierarchical Clustering

We consider the problem of constructing an an optimal-weight tree from t...
research
04/12/2019

Dominator Chromatic Numbers of Orientations of Trees

In this paper we prove that the dominator chromatic number of every orie...
research
09/25/2018

Algorithms for Euclidean Degree Bounded Spanning Tree Problems

Given a set of points in the Euclidean plane, the Euclidean δ-minimum sp...
research
02/12/2011

Multicriteria Steiner Tree Problem for Communication Network

This paper addresses combinatorial optimization scheme for solving the m...
research
11/27/2018

Systematic Exploration of the High Likelihood Set of Phylogenetic Tree Topologies

Bayesian Markov chain Monte Carlo explores tree space slowly, in part be...
research
12/02/2020

A natural extension to the convex hull problem and a novel solution

We study a natural extension to the well-known convex hull problem by in...
research
10/26/2018

Virtual Network Embedding via Decomposable LP Formulations: Orientations of Small Extraction Width and Beyond

The Virtual Network Embedding Problem (VNEP) considers the efficient all...

Please sign up or login with your details

Forgot password? Click here to reset