## Search

Now showing items 1-10 of 22

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

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

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

#### Budgeted nature reserve selection with diversity feature loss and arbitrary split systems

(University of Canterbury. Department of Mathematics and Statistics, 2010)

Arising in the context of biodiversity conservation, the Budgeted Nature Reserve Selection (BNRS) problem is to select, subject to
budgetary constraints, a set of regions to conserve so that the phylogenetic
diversity ...

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

#### The structure of 3-connected matroids of path width three

(University of Canterbury, 2005)

A 3-connected matroid M is sequential or has path width 3 if its ground set E(M) has a sequential ordering, that is, an ordering (e₁, e₂, ... , ek) such that ({e₁,e₂, .. ,,ek}, {ek+₁,ek+₂, .. ,,en}) is a 3-separation for ...

#### A supertree algorithm for higher taxa

(University of Canterbury, 2003)

Most supertree algorithms combine collections of rooted phylogenetic trees with overlapping leaf sets into a single rooted phylogenetic tree (for example, see [1, 4, 6, 7]). Implicit in all of these algorithms is that the ...

#### Hybridization in non-binary trees

(University of Canterbury, 2008)

Reticulate evolution-the umbrella term for processes like hybridization,
horizontal gene transfer, and recombination-plays an important
role in the history of life of many species. Although the occurrence of such
events ...

#### Optimizing phylogenetic diversity under constraints

(University of Canterbury, 2006)

Phylogenetic diversity (PD) is a measure of the extent to which different subsets of taxa span an evolutionary tree, and provides a quantitative tool for studying biodiversity conservation. Recently, it was shown that the ...