## Search

Now showing items 1-10 of 10

#### Analyzing and reconstructing reticulation networks under timing constraints

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

Reticulation networks are now frequently used to model the history of life for various groups of organisms whose evolutionary past is likely to include reticulation events like horizontal gene transfer
or hybridization. ...

#### Regulation of transendothelial low-density lipoprotein transmission by fluid shear stress

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

The link between atherosclerosis and regions of disturbed flow and
low wall shear stress is now firmly established, but the causal mechanisms
underlying the link are not yet understood. A crucial factor in the
early ...

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

(University of Canterbury, 2004)

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

#### Visualizing coalescent theory

(University of Canterbury. Mathematics and Statistics, 2008)

Coalescent theory is a field of statistical genetics that can offer insight to molecular evolutionary biologists. In order to apply Coalescent Theory in their field studies, biologists must understand the coalescent models. ...

#### Quantifying the extent of lateral gene transfer required to avert a 'genome of eden'

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

The complex pattern of presence and absence of many genes across different species provides
tantalising clues as to how genes evolved through the processes of gene genesis, gene loss and lateral gene
transfer (LGT). The ...

#### Quartet compatibility and the quartet graph

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

A collection P of leaf-labelled trees is compatible if there exists a single leaf-labelled tree that displays each of the trees in P. Despite its
difficulty, determining the compatibility of P is a fundamental task in ...

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

#### Quantifying hybridization in realistic time

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

Recently, numerous practical and theoretical studies in evolutionary biology aim at calculating the extent to which reticulation-for example horizontal gene transfer, hybridization,
or recombination-has influenced the ...

#### Nature reserve selection problem : a tight approximation algorithm

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

The Nature Reserve Selection Problem is a problem that arises
in the context of studying biodiversity conservation. Subject to budgetary
constraints, the problem is to select a set of regions to conserve so that ...

#### Computing the rooted subtree prune and distance is NP-hard

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

The graph-theoretic operation of rooted subtree prune and regraft
is increasingly being used as a tool for understanding and modelling reticulation
events in evolutionary biology. In this paper, we show that computing
the ...