University of Canterbury. Mathematics and Statistics.
Doi
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
