Prediction of Golgi Type II membrane proteins based on their transmembrane domains

Motivation: A major issue in cell biology today is how distinct intracellular regions of the cell, like the Golgi Apparatus, maintain their unique composition of proteins and lipids. The cell differentially separates Golgi resident proteins from proteins that move through the organelle to other subcellular destinations. We set out to determine if we could distinguish these two types of transmembrane proteins using computational approaches. Results: A new method has been developed to predict Golgi membrane proteins based on their transmembrane domains. To establish the prediction procedure, we took the hydrophobicity values and frequencies of different residues within the transmembrane domains into consideration. A simple linear discriminant function was developed with a small number of parameters derived from a dataset of Type II transmembrane proteins of known localization. This can discriminate between proteins destined for Golgi apparatus or other locations (post-Golgi) with a success rate of 89.3% or 85.2%, respectively on our redundancy-reduced data sets.

Macropodid herpesvirus 1 encodes genes for both thymidylate synthase and ICP34.5

Macropodid herpesvirus 1 (MaHV-1) is an unclassified alphaherpesvirus linked with the fatal infections of kangaroos and other marsupials. During the characterisation of the internal repeat region of MaHV-1, an open reading frame (ORF) encoding for thymidylate synthase (TS) gene was identified and completely sequenced. Southern blot analysis confirmed the presence of two copies of the TS gene in the MaHV-1 genome as expected. Computer analysis of the TS ORF showed it was 948 nucleotides in length. A putative polyadenylation signal was identified 17-22 bp inside the ORF implying a minimal or absent 3' untranslated region. The predicted polypeptide was 316 amino acid residues in length and contained the highly conserved motifs for folate binding and F-dUMP binding, typical of all TS enzymes. Interestingly, MaHV-1 TS polypeptide had highest similarity to the human TS polypeptide (81%) compared to the TS polypeptides of other herpesviruses (72-75%). Immediately upstream of the TS gene, a second ORF of 510 bp, encoding a polypeptide with 170 amino acid residues, was identified. The carboxyl domain of this MaHV-1 polypeptide shared 68% similarity to a 59 amino acid motif of human herpesvirus 1 ICP34.5, identifying it as the MaHV-1 ICP34.5 homologue. This is the first report of a herpesvirus that encodes for both TS and ICP34.5.

Modelling High-Dimensional Data by Mixtures of Factor Analyzers

We focus on mixtures of factor analyzers from the perspective of a method for model-based density estimation from high-dimensional data, and hence for the clustering of such data. This approach enables a normal mixture model to be fitted to a sample of n data points of dimension p, where p is large relative to n. The number of free parameters is controlled through the dimension of the latent factor space. By working in this reduced space, it allows a model for each component-covariance matrix with complexity lying between that of the isotropic and full covariance structure models. We shall illustrate the use of mixtures of factor analyzers in a practical example that considers the clustering of cell lines on the basis of gene expressions from microarray experiments. (C) 2002 Elsevier Science B.V. All rights reserved.

Difference equations in Banach spaces

Difference equations which discretely approximate boundary value problems for second-order ordinary differential equations are analysed. It is well known that the existence of solutions to the continuous problem does not necessarily imply existence of solutions to the discrete problem and, even if solutions to the discrete problem are guaranteed, they may be unrelated and inapplicable to the continuous problem. Analogues to theorems for the continuous problem regarding a priori bounds and existence of solutions are formulated for the discrete problem. Solutions to the discrete problem are shown to converge to solutions of the continuous problem in an aggregate sense. An example which arises in the study of the finite deflections of an elastic string under a transverse load is investigated. The earlier results are applied to show the existence of a solution; the sufficient estimates on the step size are presented. (C) 2003 Elsevier Science Ltd. All rights reserved.

Principles versus artifacts in computer science curriculum design

Computer Science is a subject which has difficulty in marketing itself. Further, pinning down a standard curriculum is difficult-there are many preferences which are hard to accommodate. This paper argues the case that part of the problem is the fact that, unlike more established disciplines, the subject does not clearly distinguish the study of principles from the study of artifacts. This point was raised in Curriculum 2001 discussions, and debate needs to start in good time for the next curriculum standard. This paper provides a starting point for debate, by outlining a process by which principles and artifacts may be separated, and presents a sample curriculum to illustrate the possibilities. This sample curriculum has some positive points, though these positive points are incidental to the need to start debating the issue. Other models, with a less rigorous ordering of principles before artifacts, would still gain from making it clearer whether a specific concept was fundamental, or a property of a specific technology. (C) 2003 Elsevier Ltd. All rights reserved.

One-dimensional quantum walk with unitary noise

The effect of unitary noise on the discrete one-dimensional quantum walk is studied using computer simulations. For the noiseless quantum walk, starting at the origin (n=0) at time t=0, the position distribution P-t(n) at time t is very different from the Gaussian distribution obtained for the classical random walk. Furthermore, its standard deviation, sigma(t) scales as sigma(t)similar tot, unlike the classical random walk for which sigma(t)similar toroott. It is shown that when the quantum walk is exposed to unitary noise, it exhibits a crossover from quantum behavior for short times to classical-like behavior for long times. The crossover time is found to be Tsimilar toalpha(-2), where alpha is the standard deviation of the noise.

A new method for analysing the equilibrium and time-dependent behaviour of Markovian models

Many large-scale stochastic systems, such as telecommunications networks, can be modelled using a continuous-time Markov chain. However, it is frequently the case that a satisfactory analysis of their time-dependent, or even equilibrium, behaviour is impossible. In this paper, we propose a new method of analyzing Markovian models, whereby the existing transition structure is replaced by a more amenable one. Using rates of transition given by the equilibrium expected rates of the corresponding transitions of the original chain, we are able to approximate its behaviour. We present two formulations of the idea of expected rates. The first provides a method for analysing time-dependent behaviour, while the second provides a highly accurate means of analysing equilibrium behaviour. We shall illustrate our approach with reference to a variety of models, giving particular attention to queueing and loss networks. (C) 2003 Elsevier Ltd. All rights reserved.

Electron exchange coupling for single-donor solid-state spin qubits

Intervalley interference between degenerate conduction band minima has been shown to lead to oscillations in the exchange energy between neighboring phosphorus donor electron states in silicon [B. Koiller, X. Hu, and S. Das Sarma, Phys. Rev. Lett. 88, 027903 (2002); Phys. Rev. B 66, 115201 (2002)]. These same effects lead to an extreme sensitivity of the exchange energy on the relative orientation of the donor atoms, an issue of crucial importance in the construction of silicon-based spin quantum computers. In this article we calculate the donor electron exchange coupling as a function of donor position incorporating the full Bloch structure of the Kohn-Luttinger electron wave functions. It is found that due to the rapidly oscillating nature of the terms they produce, the periodic part of the Bloch functions can be safely ignored in the Heitler-London integrals as was done by Koiller, Hu, and Das Sarma, significantly reducing the complexity of calculations. We address issues of fabrication and calculate the expected exchange coupling between neighboring donors that have been implanted into the silicon substrate using an 15 keV ion beam in the so-called top down fabrication scheme for a Kane solid-state quantum computer. In addition, we calculate the exchange coupling as a function of the voltage bias on control gates used to manipulate the electron wave functions and implement quantum logic operations in the Kane proposal, and find that these gate biases can be used to both increase and decrease the magnitude of the exchange coupling between neighboring donor electrons. The zero-bias results reconfirm those previously obtained by Koiller, Hu, and Das Sarma.

Product form approximations for highly linear loss networks with trunk reservation

Admission controls, such as trunk reservation, are often used in loss networks to optimise their performance. Since the numerical evaluation of performance measures is complex, much attention has been given to finding approximation methods. The Erlang Fixed-Point (EFP) approximation, which is based on an independent blocking assumption, has been used for networks both with and without controls. Several more elaborate approximation methods which account for dependencies in blocking behaviour have been developed for the uncontrolled setting. This paper is an exploratory investigation of extensions and synthesis of these methods to systems with controls, in particular, trunk reservation. In order to isolate the dependency factor, we restrict our attention to a highly linear network. We will compare the performance of the resulting approximations against the benchmark of the EFP approximation extended to the trunk reservation setting. By doing this, we seek to gain insight into the critical factors in constructing an effective approximation. (C) 2003 Elsevier Ltd. All rights reserved.

Implicit vector equilibrium problems with applications

Let X and Y be Hausdorff topological vector spaces, K a nonempty, closed, and convex subset of X, C: K--> 2(Y) a point-to-set mapping such that for any x is an element of K, C(x) is a pointed, closed, and convex cone in Y and int C(x) not equal 0. Given a mapping g : K --> K and a vector valued bifunction f : K x K - Y, we consider the implicit vector equilibrium problem (IVEP) of finding x* is an element of K such that f (g(x*), y) is not an element of - int C(x) for all y is an element of K. This problem generalizes the (scalar) implicit equilibrium problem and implicit variational inequality problem. We propose the dual of the implicit vector equilibrium problem (DIVEP) and establish the equivalence between (IVEP) and (DIVEP) under certain assumptions. Also, we give characterizations of the set of solutions for (IVP) in case of nonmonotonicity, weak C-pseudomonotonicity, C-pseudomonotonicity, and strict C-pseudomonotonicity, respectively. Under these assumptions, we conclude that the sets of solutions are nonempty, closed, and convex. Finally, we give some applications of (IVEP) to vector variational inequality problems and vector optimization problems. (C) 2003 Elsevier Science Ltd. All rights reserved.

Quasiequilibrium problem in H-spaces

In the present paper, we study the quasiequilibrium problem and generalized quasiequilibrium problem of generalized quasi-variational inequality in H-spaces by a new method. Some new equilibrium existence theorems are given. Our results are different from corresponding given results or contain some recent results as their special cases. (C) 2003 Elsevier Science Ltd. All rights reserved.

Model-based clustering in gene expression microarrays: An application to breast cancer data

In microarray studies, the application of clustering techniques is often used to derive meaningful insights into the data. In the past, hierarchical methods have been the primary clustering tool employed to perform this task. The hierarchical algorithms have been mainly applied heuristically to these cluster analysis problems. Further, a major limitation of these methods is their inability to determine the number of clusters. Thus there is a need for a model-based approach to these. clustering problems. To this end, McLachlan et al. [7] developed a mixture model-based algorithm (EMMIX-GENE) for the clustering of tissue samples. To further investigate the EMMIX-GENE procedure as a model-based -approach, we present a case study involving the application of EMMIX-GENE to the breast cancer data as studied recently in van 't Veer et al. [10]. Our analysis considers the problem of clustering the tissue samples on the basis of the genes which is a non-standard problem because the number of genes greatly exceed the number of tissue samples. We demonstrate how EMMIX-GENE can be useful in reducing the initial set of genes down to a more computationally manageable size. The results from this analysis also emphasise the difficulty associated with the task of separating two tissue groups on the basis of a particular subset of genes. These results also shed light on why supervised methods have such a high misallocation error rate for the breast cancer data.

An augmented Lanczos algorithm for the efficient computation of a dot-product of a function of a large sparse symmetric matrix

The Lanczos algorithm is appreciated in many situations due to its speed. and economy of storage. However, the advantage that the Lanczos basis vectors need not be kept is lost when the algorithm is used to compute the action of a matrix function on a vector. Either the basis vectors need to be kept, or the Lanczos process needs to be applied twice. In this study we describe an augmented Lanczos algorithm to compute a dot product relative to a function of a large sparse symmetric matrix, without keeping the basis vectors.

Assessing childrens competence in computer interactions: Preliminary reliability and validity of the test of mouse proficiency

The Test of Mouse Proficiency (TOMP) was developed to assist occupational therapists and education professionals assess computer mouse competency skills in children from preschool to upper primary (elementary) school age. The preliminary reliability and validity of TOMP are reported in this paper. Methods used to examine the internal consistency, test-retest reliability, and criterion- and construct-related validity of the test are elaborated. In the continuing process of test refinement, these preliminary studies support to varying degrees the reliability and validity of TOMP. Recommendations for further validation of the assessment are discussed along with indications for potential clinical application.

Making developmental biology relevant to undergraduates in an era of economic rationalism in Australia

This report describes the road map we followed at our university to accommodate three main factors: financial pressure within the university system; desire to enhance the learning experience of undergraduates; and motivation to increase the prominence of the discipline of developmental biology in our university. We engineered a novel, multi-year undergraduate developmental biology program which was student-oriented, ensuring that students were continually exposed to the underlying principles and philosophy of this discipline throughout their undergraduate career. Among its key features are introductory lectures in core courses in the first year, which emphasize the relevance of developmental biology to tissue engineering, reproductive medicine, therapeutic approaches in medicine, agriculture and aquaculture. State-of-the-art animated computer graphics and images of high visual impact are also used. In addition, students are streamed into the developmental biology track in the second year, using courses like human embryology and courses shared with cell biology, which include practicals based on modern experimental approaches. Finally, fully dedicated third-year courses in developmental biology are undertaken in conjunction with stand-alone practical courses where students experience first-hand work in a research laboratory. Our philosophy is a cradle-to-grave approach to the education of undergraduates so as to prepare highly motivated, enthusiastic and well-educated developmental biologists for entry into graduate programs and ultimately post-doctoral research.