An exact algorithm for the minimum quartet tree cost problem

DOI10.1007/S10288-018-0394-2MaRDI QIDQ2283933zbMATH OpenOpenAlexFDO

Authors S. Consoli, Gijs Geleijnse, Steffen Pauws, J. Korst

Publication date 13 January 2020

Published in 4OR (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10288-018-0394-2

zbMATH Keywords

cluster analysiscombinatorial optimizationexact solution algorithmsgraphsminimum quartet tree costquartet trees

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• Improved metaheuristics for the quartet method of hierarchical clustering
• A fast quartet tree heuristic for hierarchical clustering
• Minimum tree cost quartet puzzling
• scientific article; zbMATH DE number 1305402
• New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem

Cites work

• A fast quartet tree heuristic for hierarchical clustering
• Clustering by Compression
• Figurate numbers
• scientific article; zbMATH DE number 1264488 (Why is no real title available?)
• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• scientific article; zbMATH DE number 1522338 (Why is no real title available?)
• scientific article; zbMATH DE number 758277 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• Solving the minimum labelling spanning tree problem using hybrid local search
• Some counting problems related to permutation groups
• The complexity of reconstructing trees from qualitative characters and subtrees
• The generation of random, binary unordered trees

Cited in

(4)

• Improved metaheuristics for the quartet method of hierarchical clustering
• Combinatorial optimization solutions for the maximum quartet consistency problem
• A generalized solution to the quadtree expected complexity problem
• A fast quartet tree heuristic for hierarchical clustering

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: An exact algorithm for the minimum quartet tree cost problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2283933)