Biomedical subjects

Xiaobo Zhou

Publications and source records attributed to Xiaobo Zhou.

5 recordsLinked to original sources

PubMed2004

A Bayesian connectivity-based approach to constructing probabilistic gene regulatory networks.

MOTIVATION: We have hypothesized that the construction of transcriptional regulatory networks using a method that optimizes connectivity would lead to regulation consistent with biological expectations. A key expectation is that the hypothetical networks should produce a few, very strong attractors, highly similar to the original observations, mimicking biological state stability and determinism. Another central expectation is that, since it is expected that the biological control is distributed and mutually reinforcing, interpretation of the observations should lead to a very small number of connection schemes. RESULTS: We propose a fully Bayesian approach to constructing probabilistic gene regulatory networks (PGRNs) that emphasizes network topology. The method computes the possible parent sets of each gene, the corresponding predictors and the associated probabilities based on a nonlinear perceptron model, using a reversible jump Markov chain Monte Carlo (MCMC) technique, and an MCMC method is employed to search the network configurations to find those with the highest Bayesian scores to construct the PGRN. The Bayesian method has been used to construct a PGRN based on the observed behavior of a set of genes whose expression patterns vary across a set of melanoma samples exhibiting two very different phenotypes with respect to cell motility and invasiveness. Key biological features have been faithfully reflected in the model. Its steady-state distribution contains attractors that are either identical or very similar to the states observed in the data, and many of the attractors are singletons, which mimics the biological propensity to stably occupy a given state. Most interestingly, the connectivity rules for the most optimal generated networks constituting the PGRN are remarkably similar, as would be expected for a network operating on a distributed basis, with strong interactions between the components.

Algorithms↗

PubMed2004

Gene clustering based on clusterwide mutual information.

Cluster analysis of gene-wide expression data from DNA microarray hybridization studies has proved to be a useful tool for identifying biologically relevant groupings of genes and constructing gene regulatory networks. The motivation for considering mutual information is its capacity to measure a general dependence among gene random variables. We propose a novel clustering strategy based on minimizing mutual information among gene clusters. Simulated annealing is employed to solve the optimization problem. Bootstrap techniques are employed to get more accurate estimates of mutual information when the data sample size is small. Moreover, we propose to combine the mutual information criterion and traditional distance criteria such as the Euclidean distance and the fuzzy membership metric in designing the clustering algorithm. The performances of the new clustering methods are compared with those of some existing methods, using both synthesized data and experimental data. It is seen that the clustering algorithm based on a combined metric of mutual information and fuzzy membership achieves the best performance. The supplemental material is available at www.gspsnap.tamu.edu/gspweb/zxb/glioma_zxb.

Algorithms↗

PubMed2003

Missing-value estimation using linear and non-linear regression with Bayesian gene selection.

MOTIVATION: Data from microarray experiments are usually in the form of large matrices of expression levels of genes under different experimental conditions. Owing to various reasons, there are frequently missing values. Estimating these missing values is important because they affect downstream analysis, such as clustering, classification and network design. Several methods of missing-value estimation are in use. The problem has two parts: (1) selection of genes for estimation and (2) design of an estimation rule. RESULTS: We propose Bayesian variable selection to obtain genes to be used for estimation, and employ both linear and nonlinear regression for the estimation rule itself. Fast implementation issues for these methods are discussed, including the use of QR decomposition for parameter estimation. The proposed methods are tested on data sets arising from hereditary breast cancer and small round blue-cell tumors. The results compare very favorably with currently used methods based on the normalized root-mean-square error. AVAILABILITY: The appendix is available from http://gspsnap.tamu.edu/gspweb/zxb/missing_zxb/ (user: gspweb; passwd: gsplab).

Algorithms↗

PubMed2003

Binarization of microarray data on the basis of a mixture model.

Although gathered as continuous data, expression measurements from gene microarrays may be quantized before downstream analysis and modeling. This is especially true for modeling gene prediction and genetic regulatory networks. Coarse quantization results in lower computational requirements, lower data requirements for model inference, and easier conceptualization. This paper proposes a mixture model for binarization. For each gene, the model, composed of a sum of two distributions, is fit to expression data for that gene, and data points are binarized according to the model. The mixture model is based on the assumption of multiplicative up-regulation. The proposed method is compared with mean and median binarization by comparing classification performance based on the binary data from the different methods. Classification is performed for simulated data generated from a microarray model studied previously and for cancer data arising from two studies involving hereditary breast cancer and small, round blue-cell tumors of childhood.

Breast Neoplasms↗

PubMed2002

[Anti-apoptosis gene survivin promotes cell growth and transformation].

OBJECTIVE: To investigate the role and molecular mechanism of surviving, an anti-apoptosis gene, in cell growth and transformation. METHODS: Coding sequence of surviving was amplified from Daudi cell mRNA by RT-PCR and then cloned into prokaryotic and eukaryotic vectors. The vectors with surviving were transfected into BL21 cells of Escherichia coli and human embryonic kidney 293 cells. The cells were cultured. Protein was extracted from the cells and examined by gel electrophoresis. Suspension of 293 cells was cultured and the number of cells was counted every other day, thus a growth curve was drawn. Another suspension of 293 cells was cultured in soft agar to observe the number of colonies. Cells transfected with plasmids void of surviving were used as controls. RESULTS: The anti-apoptosis gene surviving was well expressed in BL21 cells and 293 cells. The growth curve showed that the proliferation rate of 293 cells was slightly faster than that of control cells, however, without significant difference. Soft agar assay showed that the colonies formed by surviving-transfected 293 cells were of greater size and with greater number. Western blotting showed overexpression of cyclin D1 and c-myc, two important cancer proteins, in cells transfected with surviving. CONCLUSION: The anti-apoptosis gene surviving promotes cell transformation. These effects may depend on the functions of cyclin D1 and c-myc.

Apoptosis↗