Proving phylogenetic trees minimal with l-clustering and set partitioning

DOI10.1016/0025-5564(80)90091-7zbMath0443.92007OpenAlexW2074659777MaRDI QIDQ1144514

Les R. Foulds, Michael D. Hendy, David Penny

Publication date: 1980

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0025-5564(80)90091-7

zbMATH Keywords

partitioningclusteringphylogenetic treesprotein sequence data

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Genetics and epigenetics (92D10) Applications of graph theory to circuits and networks (94C15) Physiological, cellular and medical topics (92Cxx)

Related Items (3)

Characterizing local optima for maximum parsimony ⋮ Parsimonious phylogenetic trees in metric spaces and simulated annealing ⋮ On the number of binary characters needed to recover a phylogeny using maximum parsimony

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Parallel concepts in graph theory
• Steiner's problem in graphs and its implications
• The steiner problem in graphs

This page was built for publication: Proving phylogenetic trees minimal with l-clustering and set partitioning