Recent Submissions

  • A study of line reduction methods for interactive computer mapping 

    Peter, Smith (University of Canterbury, 1987)
    With the increasing availability of powerful graphics workstations, interactive computer mapping systems are becoming more and more popular. The art of map making is thousands of years old and much is still relevant, However, ...
  • Scientist's workbook 

    JasonSmith, Michael (University of Canterbury, 1999)
    This project discusses the scientist's workbook, a system designed to assist scientists' in their work. An overview of similar systems, such as the Memex and Xanadu, is presented. The results of a series of interviews ...
  • Fast evaluation of radial basis functions : methods for four-dimensional polyharmonic splines 

    Cherrie, J. B.; Beatson, R. K.; Ragozin, D. L. (University of Canterbury. Department of Mathematics & Statistics, 2000)
    As is now well known for some basic functions ϕ, hierarchical and fast multipole like methods can greatly reduce the storage and operation counts for fitting and evaluating radial basis functions. In particular for spline ...
  • Graphical tool for SC automata 

    Haslett, L. (University of Canterbury, 2000)
    SC automata are a variation of timed automata which are closed under complementation. The major difference is SC automata have both history clocks which represent the time since some event occurred in the past and ...
  • An assembly language trainer on the Macintosh 

    Chong, K. F. (University of Canterbury, 1987)
    The COSC-1 Assembly Language Simulator running on the Micro Network was developed as a tool for teaching the basics of computer structure and assembly language programming. COSC-1 fs a simple computer of complexity about ...
  • GPSS/750 simulation system 

    Ting, C. K. (University of Canterbury, 1982)
    In the field of software engineering, it is now recognized that proper language design can greatly improve the reliability, clarity, ease of implementation and maintenance of software written in that language. Two ...
  • Selecting taxa to save or sequence : desirable criteria and a greedy solution 

    Bordewich, M.; Rodrigo, A. G.; Semple, C. (University of Canterbury, 2007)
    Three desirable properties for any method of selecting a subset of evolutionary units (EUs) for conservation or for genomic sequencing are discussed. These properties are: spread, stability, and applicability. We are ...
  • Supertree algorithms for ancestral divergence dates and nested taxa 

    Semple, C.; Daniel, P.; Page, R. D. M.; Hordijk, W.; Steel, M. (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 ...
  • 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 ...
  • A 3-approximation algorithm for the subtree between phylogenies 

    Bordewich, M.; McCartin, C.; Semple, C. (University of Canterbury, 2007)
    In this paper, we give a (polynomial-time) 3-approximation algorithm for the rooted subtree prune and regraft distance between two phylogenetic trees. This problem is known to be NP-complete and the best previously known ...
  • Bounding the number of hybridisation events for a consistent evolutionary history 

    Baroni, M.; Grunewald, S.; Moulton, V.; Semple, C. (University of Canterbury, 2004)
    Evolutionary processes such as hybridisation, lateral gene transfer, and recombination are all key factors in shaping the structure of genes and genomes. However, since such processes are not always best represented by ...
  • Identifying phylogenetic trees 

    Bordewich, M.; Huber, K. T.; Semple, C. (University of Canterbury, 2004)
    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 X-tree ...
  • A supertree algorithm for higher taxa 

    Daniel, Philip; Semple, Charles (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 ...
  • Wild triangles in 3-connected matroids 

    Oxley, J.; Semple, C.; Whittle, G. (University of Canterbury, 2006)
    Tutte's Triangle Lemma proves that if {a, b, c} is a triangle in a 3-connected matroid and neither M\a nor M\b is 3-connected, then M has a triad that contains a and exactly one of b and c. Hence {a, b, c} is contained in ...
  • Computing the minimum number of hybridisation events for a consistent evolutionary history 

    Bordewich, M.; Semple, C. (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 ...
  • The structure of equivalent 3-separations in a 3-connected matroid 

    Hall, R.; Oxley, J.; Semple, C. (University of Canterbury, 2004)
    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 is ...
  • Using graphical modelling in official statistics 

    Penny, R. N.; Reale, M. (University of Canterbury, 2004)
    People using economic time series would like them to be available as soon as possible after the end of the reference period. However there can be difficulties in getting all the responses required to produce a series of ...
  • Counting consistent phylogenetic trees is #P-complete 

    Bordewich, M.; Semple, C.; Talbot, J. (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 chain theorem for matroids 

    Oxley, J.; Semple, C.; Whittle, G. (University of Canterbury, 2006)
    Tutte's Wheels-and-Whirls Theorem proves that if M is a 3-connected matroid other than a wheel or a whirl, then M has a 3-connected minor N such that |E(M)| - |E(N)| = 1. Geelen and Whittle extended this theorem by showing ...
  • An Expert System for Loan Decisions 

    Ang, L. (University of Canterbury, 1987)
    For more than 20 years, scientists working in the field of Artificial Intelligence have been developing computer programs that could solve problems in a way that would be considered intelligent if done by a human. At ...

View more