Reconstructing minimal rooted trees
Type of content
Journal Article
UC permalink
Publisher's DOI/URI
Thesis discipline
Degree name
Publisher
University of Canterbury. Mathematics and Statistics.
Journal Title
Journal ISSN
Volume Title
Language
Date
2003
Authors
Semple, C.
Abstract
For a set T of rooted binary leaf-labelled trees, we present an algorithm that finds all of the minor-minimal trees that are compatible with T . 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 classifcation, particularly evolutionary biology.
Description
Citation
Semple, C. (2003) Reconstructing minimal rooted trees. Discrete Applied Mathematics, 127(3), pp. 489-503.