## Search

Now showing items 1-9 of 9

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

#### Two further links between MP and ML under the Poisson model

(University of Canterbury, 2003)

Maximum parsimony and maximum likelihood are two contrasting
approaches for reconstructing phylogenetic trees from sequence and character
data. We establish analytic links between these methods (extending connections
reported ...

#### Supertree algorithms for ancestral divergence dates and nested taxa

(University of Canterbury, 2003)

Most supertree methods use just leaf-labelled phylogenetic trees to infer the resulting supertree. In this paper, we describe several new supertree algorithms that extend the allowable information that can be used for ...

#### Counting consistent phylogenetic trees is #P-complete

(University of Canterbury, 2003)

Reconstructing phylogenetic trees is a fundamental task in evolutionary biology. Various algorithms exist for this purpose, many of which come under the heading of 'supertree methods'. These methods amalgamate a collection ...

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

#### Searching for primes in the digits of [pi]

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

Many people are fascinated by π. Vast amounts of human and computer resources have been spent producing billions
of its digits. Similarly, many people are intrigued by primes. How
many primes are there within the digits ...

#### Performance of various BFGS and DFP implementations with limited precision second order information.

(University of Canterbury, 2003)

This paper supports the claim that there is no discernible advantage in choosing factorised implementations (over non–factorised implementations) of BFGS methods when approximate Hessian information is available to full ...

#### Mollification formulas and implicit smoothing.

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

This paper develops some mollification formulas involving convolutions between popular radial basis function (RBF) basic functions
ϕ, and suitable mollifiers k. Polyharmonic spline, scaled Bessel
kernel (Matern ...

#### Peeling phylogenetic 'oranges'

(University of Canterbury, 2003)

We investigate the combinatorics of a topological space that is generated by the
set of edge-weighted finite trees. This space arises by multiplying the weights
of edges on paths in trees and is closely connected to tree ...