## Search

Now showing items 1-10 of 11

#### Bounding the Number of Hybridisation Events for a Consistent Evolutionary History

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

#### Identifying phylogenetic trees

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

A central problem that arises in evolutionary biology is that of
displaying partitions of subsets of a finite set X on a tree whose vertices are
partially labelled with the elements of X. Such a tree is called an ...

#### The structure of equivalent 3-separations in a 3-connected matroid

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

Let M be a matroid. When M is 2-connected, Cunningham and
Edmonds gave a tree decomposition of M that displays all of its 2-separations.
This result was extended by Oxley, Semple, and Whittle, who showed that,
when M ...

#### Exact symbol error probabilities for SVD transmission of BPSK data over fading channels

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

In this paper we derive a generalized method to compute the error probabilities of singular value decompositionbased receivers for a MIMO system with uncoded transmission. The method can be used for a wide class of flat ...

#### Approximating the Probability Distribution of OFDM Symbol Errors

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

Given an N subcarrier orthogonal frequency division multiplexing (OFDM) system transmitting over a slow fading Rayleigh channel, the distribution of b, the number of received symbol errors, is Poisson binomial. Hence, (N ...

#### A flexible model for dimensioning mixed service 3G wireless networks

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

In this paper we present an approximate closed form
solution for dimensioning mixed service 3G wireless networks for
defined service and quality constraints. Both web-browsing
services alone, as well as a mixture of web ...

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

#### A Class of General Supertree Methods for Nested Taxa

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

Amalgamating smaller evolutionary trees into a single parent tree
is an important task in evolutionary biology. Traditionally, the (supertree)
methods used for this amalgamation take a collection of leaf-labelled trees ...

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

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

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

#### Comparison of adaptive and sliding-scale glycaemic control in critical care and the impact of nutritional inputs

(University of Canterbury. Mechanical Engineering., 2005)

Stress-induced hyperglycaemia is
prevalent in critical care. Tight glucose control can
reduce mortality up to 43%. An adaptive control
algorithm utilising insulin and nutritional feed
inputs for targeted glycaemic ...