Statistics

Reconstructing minimal rooted trees

View/Open

Author

Date

Permanent Link

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 classification,
particularly evolutionary biology.