Now showing items 1-4 of 4
Optimisation based identification of cardiovascular system model parameters for patient specific diagnostic assistance
(University of Canterbury. Civil Engineering.University of Canterbury. Mathematics and Statistics.University of Canterbury. Mechanical Engineering., 2003)
The size of a maximum agreement subtree for random binary trees
(University of Canterbury. Mathematics and Statistics, 2003)
In computational biology, a common way to compare two rooted trees that classify the same set L of labelled leaves is to determine the largest subset of L on which the two trees agree. In this paper we consider the size ...
Reconstructing minimal rooted trees
(University of Canterbury. Mathematics and Statistics., 2003)
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 ...
Iterative projection algorithms for solving inverse problems
(University of Canterbury. Electrical and Computer Engineering, 2003)
Inverse problems abound in the ocean sciences, as they do in almost every area of science and technology. Solutions to inverse problems are notoriously difficult, computationally expensive, and noise sensitive. Iterative ...