Proving phylogenetic trees minimal with l-clustering and set partitioning
type: Item
instance of: scholarly article
title: Proving phylogenetic trees minimal with l-clustering and set partitioning
zbMATH Open document ID: 0443.92007
DOI: 10.1016/0025-5564(80)90091-7
published in: Mathematical Biosciences
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 92D10
Mathematics Subject Classification ID: 92Cxx
Mathematics Subject Classification ID: 94C15
Mathematics Subject Classification ID: 62P10
zbMATH DE Number: 3693067
zbMATH Keywords: phylogenetic trees
zbMATH Keywords: clustering
zbMATH Keywords: partitioning
zbMATH Keywords: protein sequence data
author: M. D. Hendy
author: Les R. Foulds
author: David Penny
MaRDI profile type: Publication
full work available at URL: 0025-5564(80)90091-7
OpenAlex ID: W2074659777
cites work: Q4083324
cites work: The steiner problem in graphs
cites work: Steiner's problem in graphs and its implications
cites work: Parallel concepts in graph theory
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
description: scientific article; zbMATH DE number 3693067