Reconstructing minimal rooted trees

Authors:
Charles Semple
Affiliations:
Biomathematics Research Centre, Department of Mathematics and Statistics, University of Canterbury, Private Bag 4800, Christchurch, New Zealand
Venue:
Discrete Applied Mathematics
Year:
2003

Citing 2
Cited 2

Regular Article: Extension Operations on Sets of Leaf-Labeled Trees

Advances in Applied Mathematics
Reconstruction of rooted trees from subtrees

Discrete Applied Mathematics

Computing quadratic entropy in evolutionary trees

Computers & Mathematics with Applications
The Complexity of Inferring A Minimally Resolved Phylogenetic Supertree

SIAM Journal on Computing

Quantified Score

Hi-index	0.04

Visualization

Abstract

For a set J of rooted binary leaf-labelled trees, we present an algorithm that finds all of the minor-minimal trees that are compatible with J. The running time of this algorithm is polynomial up to the number of trees with this property. This type of problem arises in several areas of classification, particularly evolutionary biology.