On the minimum quartet tree cost problem

Sergio Consoli, Jan Korst, Gijs Geleijnse +1

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…