## Search

Now showing items 11-20 of 109

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

#### Grover's quantum algorithm applied to global optimisation

(University of Canterbury. Dept. of Mathematics and Statistics, 2004)

Grover's quantum computational search procedure can provide the basis for implementing
adaptive global optimisation algorithms. A brief overview of the procedure is given and a
framework called Grover Adaptive Search is ...

#### Computing the minimum number of hybridisation events for a consistent evolutionary history

(University of Canterbury, 2004)

It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulation events such as hybridisations mean that ...

#### Four characters suffice to convexly define a phylogenetic tree

(University of Canterbury, 2002)

It was recently shown that just five characters (functions on a finite set X) suffice to convexly define a trivalent tree with leaf set X. Here we show that four characters suffice which, since three characters is not ...

#### Recovering a phylogenetic tree using pairwise closure operations

(University of Canterbury, 2003)

A fundamental task in evolutionary biology is the amalgamation of a collection P of leaf-labelled trees into a single parent tree. A desirable feature of any such amalgamation is that the resulting tree preserves all of ...

#### Nesting polynormals [i.e. polynomials] in infinite radicals

(University of Canterbury, 2006)

We consider infinite nested radicals in which the arguments
are positive polynomial sequences. It is shown that the
evaluation of such a nesting is always finite, and we prove necessary
and sufficient conditions for the ...

#### Cyclic permutations and evolutionary trees

(University of Canterbury, 2002)

Given a tree T with leaf set X, there are certain ways of arranging
the elements of X in a circular order so that T can be embedded in the plane
and 'preserve' this ordering. We investigate some new combinatorial ...

#### On approximation of optimizing phylogenetic diversity for cluster systems

(University of Canterbury, 2009)

A basic question in conservation biology is how to maximize future
biodiversity as species face extinction. One way to approach this question
is by measuring the diversity of a set of species in terms of the evolutiona ...

#### Fast computation of compatibility for phylogenies with nested taxa

(University of Canterbury, 2005)

Typically, supertree methods combine a collection of source trees in which just the leaves are labelled by taxa. In such methods the resulting supertree is also leaf-labelled. An underlying assumption in these methods is ...

#### Signal restoration after transmission through an advective and diffusive medium

(University of Canterbury. Dept. of Mathematics and Statistics, 2002)

Inverse problem, regularisation, singular perturbation, wave splitting, wave propagators,
square root operator, inverse mass transport This paper considers an inverse problem associated
with mass transport in a pipe. It ...