## Search

Now showing items 31-40 of 177

#### Infinite anitchains of matroids with characteristics set {p}

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

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

#### Outage probability of cooperative relay networks in Nakagami-m fading channels

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

It is well known that the cooperation among nodes
can improve the performance of a wireless network. In this letter
we analyze the outage probability behaviour of a relay network
in Nakagami-m fading channels. A closed-form ...

#### Computing the distribution of a tree metric

(University of Canterbury. Mathematics and Statistics, 2009)

The Robinson-Foulds (RF) distance is by far the most widely used measure of dissimilarity between trees. Although the distribution of these distances has been investigated for twenty years, an algorithm that is explicitly ...

#### A Survey of Confidence Interval Formulae for Coverage Analysis

(Department of Computer Science and Management, University of CanterburyUniversity of Canterbury. Computer Science and Software EngineeringUniversity of Canterbury. Management, 1998)

Confidence interval estimators for proportions using normal approximation have been
commonly used for coverage analysis of simulation output even though alternative approximate estimators of confidence intervals for ...

#### Inverting random functions

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

In this paper we study how to invert random functions under different
criteria. The motivation for this study is phylogeny reconstruction, since
the evolution of biomolecular sequences may be considered as a random ...

#### Coalescent experiments I: Unlabeled n-coalescent and the site frequency spectrum

(Department of Mathematics & StatisticsUniversity of Canterbury. Mathematics and Statistics, 2009)

We derive the transition structure of a Markovian lumping of Kingman’s n-coalescent [1, 2]. Lumping a Markov chain is meant in the sense of [3, def. 6.3.1]. The lumped Markov process, referred as the
unlabeled n-coalescent, ...

#### Partial fields and matroid representation

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

A partial field P is an algebraic structure that behaves very much
like a field except that addition is a partial binary operation, that is,
for some a,b Є P, a + b may not be defined. We develop a theory of
matroid ...

#### Expected Anomolies in the Fossil Record

(University of Canterbury. Mathematics and Statistics, 2008)

The problem of intermediates in the fossil record has been frequently discussed ever since Darwin. The extent of ‘gaps’ (missing transitional stages) has been used to argue against gradual evolution from a common ancestor. ...

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

#### Computing the Hybridization Number of Two Phylogenetic Trees is Fixed-Parameter Tractable

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

Reticulation processes in evolution mean that the ancestral history of certain groups of present-day species is non-tree-like. These processes include hybridization, lateral gene transfer, and recombination. Despite the ...