An exact algorithm for the minimum quartet tree cost problem
Consoli,Sergio Korst,Jan Geleijnse,Gijs Pauws,Steffen
Consoli,Sergio
Korst,Jan
Geleijnse,Gijs
Pauws,Steffen
Abstract
The minimum quartet tree cost (MQTC) problem is a graph combinatorial optimization problem where, given a set of n >= 4 quartet topologies on n, where optimality means that the sum of the costs of the embedded (or consistent) quartet topologies is minimal. The MQTC problem is the foundation of the quartet method of hierarchical clustering, a novel hierarchical clustering method for non tree-like (non-phylogeny) data in various domains, or for heterogeneous data across domains. The MQTC problem is NP-complete and some heuristics have been already proposed in the literature. The aim of this paper is to present a first exact solution approach for the MQTC problem. Although the algorithm is able to get exact solutions only for relatively small problem instances, due to the high problem complexity, it can be used as a benchmark for validating the performance of any heuristic proposed for the MQTC problem.
Description
Date
2019-06
Journal Title
Journal ISSN
Volume Title
Publisher
Research Projects
Organizational Units
Journal Issue
Keywords
Combinatorial optimization, Quartet trees, Minimum quartet tree cost, Exact solution algorithms, Cluster analysis, Graphs
Citation
Consoli, S, Korst, J, Geleijnse, G & Pauws, S 2019, 'An exact algorithm for the minimum quartet tree cost problem', 4or-A quarterly journal of operations research, vol. 17, no. 4, pp. 401-425. https://doi.org/10.1007/s10288-018-0394-2