An efficient algorithm for supertrees
type: Item
instance of: scholarly article
title: An efficient algorithm for supertrees
zbMATH Open document ID: 0829.92013
DOI: 10.1007/BF01202270
author: Mariana Constantinescu
author: David Sankoff
published in: Journal of Classification
publication date: 1995-11-14T00:00:00Z
Mathematics Subject Classification ID: 92D15
Mathematics Subject Classification ID: 92-08
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 92-04
zbMATH DE Number: 815989
zbMATH Keywords: tree compatibility
zbMATH Keywords: supertrees
zbMATH Keywords: consensus trees
zbMATH Keywords: rooted binary trees
zbMATH Keywords: labeled leaves
zbMATH Keywords: lineage constraints
zbMATH Keywords: common ancestors
zbMATH Keywords: algorithm
MaRDI profile type: Publication
cites work: Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
cites work: Tree enumeration modulo a consensus
cites work: Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data
cites work: Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
full work available at URL: https://doi.org/10.1007/bf01202270
OpenAlex ID: W1993092519
description: scientific article; zbMATH DE number 815989