## Search

Now showing items 11-20 of 177

#### Credibility of the Final Results from Quantitative Stochastic Simulation

(University of CanterburyUniversity of Canterbury. Computer Science and Software Engineering, 1995)

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

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

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 hybridizations mean that ...

#### Teasing Apart Two Trees

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

A widely-studied model for generating binary sequences is to 'evolve' them on a tree according to a symmetric Markov process. We show that under this model distinguishing the true (model) tree from a false one is substantially ...

#### Encoding phylogenetic trees in terms of weighted quartets

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

One of the main problems in phylogenetics is to develop systematic
methods for constructing evolutionary or phylogenetic trees. For a set
of species X, an edge-weighted phylogenetic X-tree or phylogenetic tree is
a ...

#### Joint Density for Eigenvalues of Two Correlated Complex Wishart Matrices: Characterization of MIMO Systems

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

In this letter, the joint probability density function (PDF) for the eigenvalues of a complex Wishart matrix and a perturbed version of it are derived. The latter version can be used to model channel estimation errors and ...

#### Note on the hybridization number and subtree distance in phylogenetics

(University of Canterbury. Mathematics and Statistics, 2009)

For two rooted phylogenetic trees T and T', the rooted subtree prune and regraft distance between T and T' has often been used as a replacement for the hybridization number of T and T'. However, Baroni et al. [M. Baroni, ...

#### Sequential Quantile Estimation: Reference Manual of a Software Tool

(Department of Computer Science and Software Engineering, University of CanterburyUniversity of Canterbury. Computer Science and Software Engineering, 2007)

Reference Manual of a Software Tool implemented in the Context of the PhD Thesis
Sequential Analysis of Quantiles and Probability Distributions by Replicated Simulations
submitted in July 2007 at the University of Canterbury

#### Hybrids in Real Time

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

We describe some new and recent results that allow for the analysis and representation of reticulate evolution by nontree networks. In particular, we (1) present a simple result to show that, despite the presence of ...

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

#### Refining Phylogenetic Trees Given Additional Data: Algorithms Based on Parsimony

(University of Canterbury. Mathematics and Statistics, 2009)

Given a set X of taxa, a phylogenetic X-tree T that is only partially resolved, and a collection of characters on X, we consider the problem of finding a resolution (refinement) of T that minimizes the parsimony score of ...