## Search

Now showing items 21-30 of 177

#### Neighbor-Joining revealed

(University of Canterbury. Mathematics and Statistics., 2006)

It is nearly 20 years since the landmark paper (Saitou and Nei 1987) in Molecular Biology and Evolution introducing Neighbor-Joining (NJ). The method has become the most widely used method for building phylogenetic trees ...

#### Exact Performance Analysis of Optimum Combining With Multiple Interferers in Flat Rayleigh Fading

(University of Canterbury. Electrical and Computer Engineering., 2007)

This letter provides a comprehensive overview and extension of recent results on outage probabilities and bit-error rates (BER) for optimal combiners in the presence of multiple interferers and additive noise. Desired ...

#### Mathematical Aspects of the 'Tree of Life'

(University of Canterbury. Mathematics and Statistics, 2009)

In this article, we will describe some of the mathematical aspects of phylogenetics,
starting from the elementary principles, but also describing one or two deeper and
more recent results.

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

(University of Canterbury. Mathematics and Statistics, 2005)

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

#### Reconstructing minimal rooted trees

(University of Canterbury. Mathematics and Statistics., 2003)

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

#### A chain theorem for matroids

(University of Canterbury. Mathematics and Statistics., 2008)

Tutte’s Wheels-and-Whirls Theorem proves that if M is a 3-connected matroid other than a wheel or a whirl, then M has a
3-connected minor N such that |E(M)| - |E(N)| = 1. Geelen and Whittle extended this theorem by showing ...

#### Wild triangles in 3-connected matroids

(University of Canterbury. Mathematics and Statistics., 2008)

Let {a, b, c} be a triangle in a 3-connected matroid M. In this paper, we describe the structure of M relative to {a, b, c} when, for
all t in {a, b, c}, either M\t is not 3-connected, or M\t has a 3-separation
that is ...

#### Digital Image Elasto-Tomography: Combinatorial and Hybrid Optimization Algorithms for Shape-Based Elastic Property Reconstruction

(University of Canterbury. Mechanical Engineering., 2008)

Results from the application of three nonlinear stiffness reconstruction algorithms to two simple cylindrical geometries are presented in this paper. Finite-element simulated harmonic
motion data with added noise were ...

#### Leading order integrability conditions for differential-difference equations

(University of Canterbury. Mathematics and Statistics., 2008)

A necessary condition for the existence of conserved densities, ρ, and fluxes of a
differential-difference equation which depend on q shifts, for q sufficiently large, is
presented. This condition depends on the eigenvalues ...

#### The length of a random leaf coloration on a random tree.

(University of Canterbury. Mathematics and Statistics, 1997)

An assignment of colors to objects induces a natural integer weight on each tree that has these objects as leaves. This weight is called "parsimony length" in biostatistics and is the basis of the "maximum parsimony" ...