MOTIVATION A consensus sequence for a family of related sequences is, as the name suggests, a sequence that captures the features common to most members of the family. Consensus sequences are important in various DNA sequencing applications and are a convenient way to characterize a family of molecules. RESULTS This paper describes a new algorithm for… (More)
The set of integers k for which there exist three latin squares of order n having precisely k cells identical, with their remaining n 2 − k cells diierent in all three latin squares, denoted by I 3 [n], is determined here for all orders n.
Evolutionary conservation is an important indicator of function and a major component of bioinformatic methods to identify non-protein-coding genes. We present a new Bayesian method for segmenting pairwise alignments of eukaryotic genomes while simultaneously classifying segments into slowly and rapidly evolving fractions. We also describe an information… (More)
Despite the success of conventional Sanger sequencing, significant regions of many genomes still present major obstacles to sequencing. Here we propose a novel approach with the potential to alleviate a wide range of sequencing difficulties. The technique involves extracting target DNA sequence from variants generated by introduction of random mutations.… (More)
Modern biological sciences require practitioners to have increasing levels of knowledge, competence, and skills in mathematics and programming. A recent review of the science curriculum at the University of Queensland, a large, research-intensive institution in Australia, resulted in the development of a more quantitatively rigorous undergraduate program.… (More)
This paper considers the problem of inferring an original sequence from a number of erroneous copies. The problem arises in DNA sequencing, particularly in the context of emerging technologies that provide high throughput or other advantages, but at the cost of introducing many errors. We develop a Bayesian probabilistic model of the introduction of errors,… (More)
A critical set in a Latin square of order n is a set of entries in a Latin square which can be embedded in precisely one Latin square of order n. Also, if any element of the critical set is deleted, the remaining set can be embedded in more than one Latin square of order n. In this paper we find all the critical sets of different sizes in the Latin squares… (More)