Now showing items 503-522 of 693

    • Quantifying hybridization in realistic time 

      Collins, J. S.; Linz, S.; Semple, C. (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 ...
    • Quantifying the extent of lateral gene transfer required to avert a 'genome of eden' 

      Van Iersel, L.; Semple, C.; Steel, M. (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 

      Grünewald, S.; Humphries, P. J.; Semple, C. (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 ...
    • A QUEL-to-SQL data manipulation language translator 

      Webb, J. H. (University of Canterbury, 1988)
    • Radiant Ignition of New Zealand Upholstered Furniture Composites 

      Chen, Flora F (University of Canterbury. Civil Engineering, 2001)
      This experimental research evaluates the radiant ignitability of New Zealand upholstered furniture composites using the ISO Ignitability Test (ISO5657). It is a part of a larger research project on the combustion of domestic ...
    • A Random Access Protocol for Unidirectional Bus Networks 

      Mathar, R.; Pawlikowski, K. (University of Canterbury. Computer Science and Software EngineeringUniversity of Canterbury. Electrical and Computer Engineering, 1995)
      A random access protocol for packet-switched, multiple access communication via time slotted busses is investigated. Assuming heavy traffic for all stations, the access probabilities are determined as to allocate a certain ...
    • Random autocatalytic networks 

      Mossel, E.; Steel, M. A. (University of Canterbury, 2004)
      We determine conditions under which a random biochemical system is likely to contain a subsystem that is both autocatalytic and able to survive on some ambient 'food' source. Such systems have previously been investigated ...
    • Ranking Cartesian Sums and K-maximum subarrays 

      Bae, S.E.; Takaoka, T. (Department of Computer Science and Software Engineering, University of CanterburyUniversity of Canterbury. Computer Science and Software Engineering, 2006)
      We design a simple algorithm that ranks K largest in Cartesian sums X + Y in O(m + K logK) time. Based on this, K-maximum subarrays can be computed in O(n+K logK) time (1D) and O(n3 +K logK) time (2D) for input array of ...
    • Rapid evaluation of least squares and minimum evolution criteria on phylogenetic trees 

      Bryant, David James; Waddell, Peter J. (University of Canterbury. Dept. of Mathematics, 1997)
      We present fast new algorithms for evaluating trees with respect to least squares and minimum evolution (ME), the most commonly used criteria for inferring phylogenetic trees from distance data. These include: an ...
    • RBF collocation 

      Mouat, Cameron Thomas; Beatson, Richard Keith (University of Canterbury, 2002)
      In recent years radial basis function collocation has become a useful alternative to finite difference and finite element methods for solving elliptic partial differential equations. RBF collocation methods have been ...
    • Real-Time Quantitative Analysis and Surface Registration of Medical Scan Data 

      Bentley, Richard (University of Canterbury, 1993)
      Several medical scanning techniques provide data about a volume that is being scanned in a series of slices. The term volume refers to some object of interest being scanned, usually a closed three-dimensional object. ...
    • Reasonable model of the universe 

      Waylen, Peter Charles (University of Canterbury. Dept. of Mathematics, 1983)
      An insistence upon realism and simplicity is used along with Einstein's theory of gravitation to show that already ascertained facts on the large scale structure of the universe lead inexorably to a particular cosmological ...
    • Reasonable model of the universe 

      Waylen, Peter Charles (University of Canterbury. Dept. of Mathematics, 1983)
      An insistence upon realism and simplicity is used along with Einstein's theory of gravitation to show that already ascertained facts on the large scale structure of the universe lead inexorably to a particular cosmological ...
    • Reconstructing minimal rooted trees 

      Semple, Charles (University of Canterbury, 1999)
      For a set T of rooted binary leaf-labelled trees, we present an algorithm that finds all of the minor-minimal trees that are compatible with T. The running time of this algorithm is polynomial up to the number of trees with ...
    • Reconstructing phylogenies from nucleotide pattern probabilities : a survey and some new result 

      Steel, Mike A.; Hendy, M. D.; Penny, D. (University of Canterbury. Dept. of Mathematics, 1997)
      The variations between homologous nucleotide sequences representative of various species are, in part, a consequence of the evolutionary history of these species. Determining the evolutionary tree from patterns in the ...
    • Reconstructing trees when sequence sites evolve at variable rates 

      Steel, Mike A.; Székely, L. A.; Hendy, M. D. (University of Canterbury. Dept. of Mathematics, 1994)
      For a sequence of colors independently evolving on a tree under a simple Markov model, we consider conditions under which the tree can be uniquely recovered from the "sequence spectrum" - the expected frequencies of the ...
    • Recovering a phylogenetic tree using pairwise closure operations 

      Huber, K. T.; Moulton, V.; Semple, C.; Steel, M. (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 ...
    • Recovering a tree from the leaf colourations it generates under a Markov model 

      Steel, M.A. (University of Canterbury. Dept. of Mathematics, 1993)
      We describe a simple transformation that allows for the fast recovery of a tree from the probabilities such a tree induces on the colourations of its leaves under a simple Markov process (with unknown parameters). This ...
    • The Recovery of Canterbury’s Organisations:A comparative analysis of the 4 September 2010, 22 February and 13 June 2011 Earthquake 

      Stevenson, J.; Vargo, J.; Seville, E.; Kachali, H.; McNaughton, A.; Powell, F. (University of Canterbury. Civil and Natural Resources Engineering, 2012)
      The 4 September, 22 February, and 13 June earthquakes experienced in Canterbury, New Zealand would have been significant events individually. Together they present a complex and unprecedented challenge for Canterbury and ...
    • A recurrence algorithm for quadratic Hermite-Pade forms 

      Brookes, Richard Gordon; McInnes, Allan William (University of Canterbury. Dept. of Mathematics, 1989)
      A simple recurrence algorithm to generate diagonal quadratic Hermite-Padé forms is presented. It requires 0(n2) operations to calculate all the diagonal forms up to the [n, n, n] form.