## Search

Now showing items 1-6 of 6

#### Tree representations of non-symmetric group-valued proximities

(University of Canterbury, 1999)

Let X be a finite set and let d be a function from X x X into an
arbitrary group Q. An example of such a function arises by taking a tree T
whose vertices include X, assigning two elements of Q to each edge of T ( one
for ...

#### A characterization for a set of partial partitions to define an X-tree

(University of Canterbury, 1999)

Trees whose vertices are partially labelled by elements of a finite
set X provide a natural way to represent partitions of subsets of X. The condition
under which a given collection of such partial partitions of X can ...

#### Reconstructing minimal rooted trees

(University of Canterbury, 1999)

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 ...

#### Tree reconstruction via a closure operation on partial splits

(University of Canterbury, 1999)

A fundamental problem in biological classification is the reconstruction
of phylogenetic trees for a set X of species from a collection of either
subtrees or qualitative characters. This task is equivalent to tree ...

#### A supertree method for rooted trees

(University of Canterbury. Dept. of Mathematics, 1999)

The amalgamation of leaf-labelled (phylogenetic) trees on overlapping leaf sets into one (super)tree is a central problem in several areas of
classification, particularly evolutionary biology. In this paper, we describe ...

#### Infinite antichains of matroids with characteristic set {p}

(University of Canterbury, 1999)

For each prime p, we construct an infinite antichain of matroids in
which each matroid has characteristic set {p}. For p=2, each of the matroids
in our antichain is an excluded minor for the class of matroids representable ...