Molecular characterization of Osh6p, an oxysterol binding protein homolog in the yeast Saccharomyces cerevisiae

Oxysterol binding protein (OSBP) and its homologs have been shown to regulate lipid metabolism and vesicular transport. However, the exact molecular function of individual OSBP homologs remains uncharacterized. Here we demonstrate that the yeast OSBP homolog, Osh6p, bound phosphatidic acid and phosphoinositides via its N-terminal half containing the conserved OSBP-related domain (ORD). Using a green fluorescent protein fusion chimera, Osh6p was found to localize to the cytosol and patch-like or punctate structures in the vicinity of the plasma membrane. Further examination by domain mapping demonstrated that the N-terminal half was associated with FM4-64 positive membrane compartments; however, the C-terminal half containing a putative coiled-coil was localized to the nucleoplasm. Functional analysis showed that the deletion of OSH6 led to a significant increase in total cellular ergosterols, whereas OSH6 overexpression caused both a significant decrease in ergosterol levels and resistance to nystatin. Oleate incorporation into sterol esters was affected in OSH6 overexpressing cells. However, Lucifer yellow internalization, and FM4-64 uptake and transport were unaffected in both OSH6 deletion and overexpressing cells. Furthermore, osh6 Delta exhibited no defect in carboxypeptidase Y transport and maturation. Lastly, we demonstrated that both the conserved ORD and the putative coiled-coil motif were indispensable for the in vivo function of Osh6p. These data suggest that Osh6p plays a role primarily in regulating cellular sterol metabolism, possibly stero transport.

Unlocking pathology archives for molecular genetic studies: a reliable method to generate probes for chromogenic and fluorescent in situ hybridization

Chromogenic (CISH) and fluorescent ( FISH) in situ hybridization have emerged as reliable techniques to identify amplifications and chromosomal translocations. CISH provides a spatial distribution of gene copy number changes in tumour tissue and allows a direct correlation between copy number changes and the morphological features of neoplastic cells. However, the limited number of commercially available gene probes has hindered the use of this technique. We have devised a protocol to generate probes for CISH that can be applied to formalin-fixed, paraffin-embedded tissue sections (FFPETS). Bacterial artificial chromosomes ( BACs) containing fragments of human DNA which map to specific genomic regions of interest are amplified with phi 29 polymerase and random primer labelled with biotin. The genomic location of these can be readily confirmed by BAC end pair sequencing and FISH mapping on normal lymphocyte metaphase spreads. To demonstrate the reliability of the probes generated with this protocol, four strategies were employed: (i) probes mapping to cyclin D1 (CCND1) were generated and their performance was compared with that of a commercially available probe for the same gene in a series of 10 FFPETS of breast cancer samples of which five harboured CCND1 amplification; (ii) probes targeting cyclin-dependent kinase 4 were used to validate an amplification identified by microarray-based comparative genomic hybridization (aCGH) in a pleomorphic adenoma; (iii) probes targeting fibroblast growth factor receptor 1 and CCND1 were used to validate amplifications mapping to these regions, as defined by aCGH, in an invasive lobular breast carcinoma with FISH and CISH; and (iv) gene-specific probes for ETV6 and NTRK3 were used to demonstrate the presence of t(12; 15)(p12; q25) translocation in a case of breast secretory carcinoma with dual colour FISH. In summary, this protocol enables the generation of probes mapping to any gene of interest that can be applied to FFPETS, allowing correlation of morphological features with gene copy number.

Genetics and genomics of osteoclast differentiation: Integrating cell signaling pathways and gene networks

The regulation of osteoclast differentiation in the bone microenvironment is critical for normal bone remodeling, as well as for various human bone diseases. Over the last decade, our knowledge of how osteoclast differentiation occurs has progressed rapidly. We highlight some of the major advances in understanding how cell signaling and transcription are integrated to direct the differentiation of this cell type. These studies used genetic, molecular, and biochemical approaches. Additionally, we summarize data obtained from studies of osteoclast differentiation that used the functional genomic approach of global gene profiling applied to osteoclast differentiation. This genomic data confirms results from studies using the classical experimental approaches and also may suggest new modes by which osteoclast differentiation and function can be modulated. Two conclusions that emerge are that osteoclast differentiation depends on a combination of fairly ubiquitously expressed transcription factors rather than unique osteoclast factors, and that the overlay of cell signaling pathways on this set of transcription factors provides a powerful mechanism to fine tune the differentiation program in response to the local bone microenvironment.

Stochastic models for regulatory networks of the genetic toggle switch

Bistability arises within a wide range of biological systems from the A phage switch in bacteria to cellular signal transduction pathways in mammalian cells. Changes in regulatory mechanisms may result in genetic switching in a bistable system. Recently, more and more experimental evidence in the form of bimodal population distributions indicates that noise plays a very important role in the switching of bistable systems. Although deterministic models have been used for studying the existence of bistability properties under various system conditions, these models cannot realize cell-to-cell fluctuations in genetic switching. However, there is a lag in the development of stochastic models for studying the impact of noise in bistable systems because of the lack of detailed knowledge of biochemical reactions, kinetic rates, and molecular numbers. in this work, we develop a previously undescribed general technique for developing quantitative stochastic models for large-scale genetic regulatory networks by introducing Poisson random variables into deterministic models described by ordinary differential equations. Two stochastic models have been proposed for the genetic toggle switch interfaced with either the SOS signaling pathway or a quorum-sensing signaling pathway, and we have successfully realized experimental results showing bimodal population distributions. Because the introduced stochastic models are based on widely used ordinary differential equation models, the success of this work suggests that this approach is a very promising one for studying noise in large-scale genetic regulatory networks.

RNA: Networks & imaging

The past few years have brought about a fundamental change in our understanding and definition of the RNA world and its role in the functional and regulatory architecture of the cell. The discovery of small RNAs that regulate many aspects of differentiation and development have joined the already known non-coding RNAs that are involved in chromosome dosage compensation, imprinting, and other functions to become key players in regulating the flow of genetic information. It is also evident that there are tens or even hundreds of thousands of other non-coding RNAs that are transcribed from the mammalian genome, as well as many other yet-to-be-discovered small regulatory RNAs. In the recent symposium RNA: Networks & Imaging held in Heidelberg, the dual roles of RNA as a messenger and a regulator in the flow of genetic information were discussed and new molecular genetic and imaging methods to study RNA presented.

Molecular classification of cutaneous malignant melanoma by gene expression profiling

The most common human cancers are malignant neoplasms of the skin(1,2). Incidence of cutaneous melanoma is rising especially steeply, with minimal progress in non-surgical treatment of advanced disease(3,4). Despite significant effort to identify independent predictors of melanoma outcome, no accepted histopathological, molecular or immunohistochemical marker defines subsets of this neoplasm(2,3). Accordingly, though melanoma is thought to present with different 'taxonomic' forms, these are considered part of a continuous spectrum rather than discrete entities(2). Here we report the discovery of a subset of melanomas identified by mathematical analysis of gene expression in a series of samples. Remarkably, many genes underlying the classification of this subset are differentially regulated in invasive melanomas that form primitive tubular networks in vitro, a feature of some highly aggressive metastatic melanomas(5). Global transcript analysis can identify unrecognized subtypes of cutaneous melanoma and predict experimentally verifiable phenotypic characteristics that may be of importance to disease progression.

Hippocampal models for simultaneous localisation and mapping on an autonomous robot

To navigate successfully in a novel environment a robot needs to be able to Simultaneously Localize And Map (SLAM) its surroundings. The most successful solutions to this problem so far have involved probabilistic algorithms, but there has been much promising work involving systems based on the workings of part of the rodent brain known as the hippocampus. In this paper we present a biologically plausible system called RatSLAM that uses competitive attractor networks to carry out SLAM in a probabilistic manner. The system can effectively perform parameter self-calibration and SLAM in onedimension. Tests in two dimensional environments revealed the inability of the RatSLAM system to maintain multiple pose hypotheses in the face of ambiguous visual input. These results support recent rat experimentation that suggest current competitive attractor models are not a complete solution to the hippocampal modelling problem.

Curvature-driven smoothing: a learning algorithm for feed-forward networks

The performance of feed-forward neural networks in real applications can be often be improved significantly if use is made of a-priori information. For interpolation problems this prior knowledge frequently includes smoothness requirements on the network mapping, and can be imposed by the addition to the error function of suitable regularization terms. The new error function, however, now depends on the derivatives of the network mapping, and so the standard back-propagation algorithm cannot be applied. In this paper, we derive a computationally efficient learning algorithm, for a feed-forward network of arbitrary topology, which can be used to minimize the new error function. Networks having a single hidden layer, for which the learning algorithm simplifies, are treated as a special case.

Mixture density networks

Minimization of a sum-of-squares or cross-entropy error function leads to network outputs which approximate the conditional averages of the target data, conditioned on the input vector. For classifications problems, with a suitably chosen target coding scheme, these averages represent the posterior probabilities of class membership, and so can be regarded as optimal. For problems involving the prediction of continuous variables, however, the conditional averages provide only a very limited description of the properties of the target variables. This is particularly true for problems in which the mapping to be learned is multi-valued, as often arises in the solution of inverse problems, since the average of several correct target values is not necessarily itself a correct value. In order to obtain a complete description of the data, for the purposes of predicting the outputs corresponding to new input vectors, we must model the conditional probability distribution of the target data, again conditioned on the input vector. In this paper we introduce a new class of network models obtained by combining a conventional neural network with a mixture density model. The complete system is called a Mixture Density Network, and can in principle represent arbitrary conditional probability distributions in the same way that a conventional neural network can represent arbitrary functions. We demonstrate the effectiveness of Mixture Density Networks using both a toy problem and a problem involving robot inverse kinematics.

Topographic mappings and feed-forward neural networks

This thesis is a study of the generation of topographic mappings - dimension reducing transformations of data that preserve some element of geometric structure - with feed-forward neural networks. As an alternative to established methods, a transformational variant of Sammon's method is proposed, where the projection is effected by a radial basis function neural network. This approach is related to the statistical field of multidimensional scaling, and from that the concept of a 'subjective metric' is defined, which permits the exploitation of additional prior knowledge concerning the data in the mapping process. This then enables the generation of more appropriate feature spaces for the purposes of enhanced visualisation or subsequent classification. A comparison with established methods for feature extraction is given for data taken from the 1992 Research Assessment Exercise for higher educational institutions in the United Kingdom. This is a difficult high-dimensional dataset, and illustrates well the benefit of the new topographic technique. A generalisation of the proposed model is considered for implementation of the classical multidimensional scaling (¸mds}) routine. This is related to Oja's principal subspace neural network, whose learning rule is shown to descend the error surface of the proposed ¸mds model. Some of the technical issues concerning the design and training of topographic neural networks are investigated. It is shown that neural network models can be less sensitive to entrapment in the sub-optimal global minima that badly affect the standard Sammon algorithm, and tend to exhibit good generalisation as a result of implicit weight decay in the training process. It is further argued that for ideal structure retention, the network transformation should be perfectly smooth for all inter-data directions in input space. Finally, there is a critique of optimisation techniques for topographic mappings, and a new training algorithm is proposed. A convergence proof is given, and the method is shown to produce lower-error mappings more rapidly than previous algorithms.

First year qualifying report: neural networks for extracting wind vectors from satellite scatterometer data

The ERS-1 Satellite was launched in July 1991 by the European Space Agency into a polar orbit at about km800, carrying a C-band scatterometer. A scatterometer measures the amount of radar back scatter generated by small ripples on the ocean surface induced by instantaneous local winds. Operational methods that extract wind vectors from satellite scatterometer data are based on the local inversion of a forward model, mapping scatterometer observations to wind vectors, by the minimisation of a cost function in the scatterometer measurement space.par This report uses mixture density networks, a principled method for modelling conditional probability density functions, to model the joint probability distribution of the wind vectors given the satellite scatterometer measurements in a single cell (the `inverse' problem). The complexity of the mapping and the structure of the conditional probability density function are investigated by varying the number of units in the hidden layer of the multi-layer perceptron and the number of kernels in the Gaussian mixture model of the mixture density network respectively. The optimal model for networks trained per trace has twenty hidden units and four kernels. Further investigation shows that models trained with incidence angle as an input have results comparable to those models trained by trace. A hybrid mixture density network that incorporates geophysical knowledge of the problem confirms other results that the conditional probability distribution is dominantly bimodal.par The wind retrieval results improve on previous work at Aston, but do not match other neural network techniques that use spatial information in the inputs, which is to be expected given the ambiguity of the inverse problem. Current work uses the local inverse model for autonomous ambiguity removal in a principled Bayesian framework. Future directions in which these models may be improved are given.

Mapping dissociations in verb morphology

Substantial behavioural and neuropsychological evidence has been amassed to support the dual-route model of morphological processing, which distinguishes between a rule-based system for regular items (walk–walked, call–called) and an associative system for the irregular items (go–went). Some neural-network models attempt to explain the neuropsychological and brain-mapping dissociations in terms of single-system associative processing. We show that there are problems in the accounts of homogeneous networks in the light of recent brain-mapping evidence of systematic double-dissociation. We also examine the superior capabilities of more internally differentiated connectionist models, which, under certain conditions, display systematic double-dissociations. It appears that the more differentiation models show, the more easily they account for dissociation patterns, yet without implementing symbolic computations.

Robust automatic mapping algorithms in a network monitoring scenario

Automatically generating maps of a measured variable of interest can be problematic. In this work we focus on the monitoring network context where observations are collected and reported by a network of sensors, and are then transformed into interpolated maps for use in decision making. Using traditional geostatistical methods, estimating the covariance structure of data collected in an emergency situation can be difficult. Variogram determination, whether by method-of-moment estimators or by maximum likelihood, is very sensitive to extreme values. Even when a monitoring network is in a routine mode of operation, sensors can sporadically malfunction and report extreme values. If this extreme data destabilises the model, causing the covariance structure of the observed data to be incorrectly estimated, the generated maps will be of little value, and the uncertainty estimates in particular will be misleading. Marchant and Lark [2007] propose a REML estimator for the covariance, which is shown to work on small data sets with a manual selection of the damping parameter in the robust likelihood. We show how this can be extended to allow treatment of large data sets together with an automated approach to all parameter estimation. The projected process kriging framework of Ingram et al. [2007] is extended to allow the use of robust likelihood functions, including the two component Gaussian and the Huber function. We show how our algorithm is further refined to reduce the computational complexity while at the same time minimising any loss of information. To show the benefits of this method, we use data collected from radiation monitoring networks across Europe. We compare our results to those obtained from traditional kriging methodologies and include comparisons with Box-Cox transformations of the data. We discuss the issue of whether to treat or ignore extreme values, making the distinction between the robust methods which ignore outliers and transformation methods which treat them as part of the (transformed) process. Using a case study, based on an extreme radiological events over a large area, we show how radiation data collected from monitoring networks can be analysed automatically and then used to generate reliable maps to inform decision making. We show the limitations of the methods and discuss potential extensions to remedy these.

Strategic innovation networks

This thesis draws on two key areas of the innovation literature, the strategic management of technology (SMOT) and innovation networks. The aim is to integrate these two areas of the management of innovation literature to develop a framework which I describe as the Strategic Innovation Network (SIN). The key proposition that the revised framework (SIN) aims to address is based on the work of Chandler (1962). Chandler's (1962) conclusion that 'structure follows strategy' is examined in relation to the interaction between corporate/technology strategy and network structure. The SIN is intended to address weaknesses in both the SMOT and network literature. The research data is based on five detailed longitudinal case studies. The organisations are defined as mid-corporate firms operating in traditional manufacturing sectors. Each organisation was chosen on the basis that it was aiming to develop its innovative capacity through product or process innovation projects. The research was carried out over an 18 month period with interviews being held regularly to develop the longitudinal aspect of the study analysis. The data for each individual case study is examined using the SIN framework. The longitudinal approach addresses the objective to provide a dynamic model of the innovation processes by mapping the changes in network structure during the course of individual projects. The network structural changes are examined in relation to each organisation's strategy and five key dynamic network stages are identified in relation to the innovation process. These network stages show the influence strategy has on the structures adopted by the five case studies.