9,717 research outputs found
Continuous non-revisiting genetic algorithm
The non-revisiting genetic algorithm (NrGA) is extended to handle continuous search space. The extended NrGA model, Continuous NrGA (cNrGA), employs the same tree-structure archive of NrGA to memorize the evaluated solutions, in which the search space is divided into non-overlapped partitions according to the distribution of the solutions. cNrGA is a bi-modulus evolutionary algorithm consisting of the genetic algorithm module (GAM) and the adaptive mutation module (AMM). When GAM generates an offspring, the offspring is sent to AMM and is mutated according to the density of the solutions stored in the memory archive. For a point in the search space with high solution-density, it infers a high probability that the point is close to the optimum and hence a near search is suggested. Alternatively, a far search is recommended for a point with low solution-density. Benefitting from the space partitioning scheme, a fast solution-density approximation is obtained. Also, the adaptive mutation scheme naturally avoid the generation of out-of-bound solutions. The performance of cNrGA is tested on 14 benchmark functions on dimensions ranging from 2 to 40. It is compared with real coded GA, differential evolution, covariance matrix adaptation evolution strategy and two improved particle swarm optimization. The simulation results show that cNrGA outperforms the other algorithms for multi-modal function optimization.published_or_final_versio
Inferring differentiation pathways from gene expression
Motivation: The regulation of proliferation and differentiation of embryonic and adult stem cells into mature cells is central to developmental biology. Gene expression measured in distinguishable developmental stages helps to elucidate underlying molecular processes. In previous work we showed that functional gene modules, which act distinctly in the course of development, can be represented by a mixture of trees. In general, the similarities in the gene expression programs of cell populations reflect the similarities in the differentiation path
Sparse multi-view matrix factorisation: a multivariate approach to multiple tissue comparisons
Gene expression levels in a population vary extensively across tissues. Such
heterogeneity is caused by genetic variability and environmental factors, and
is expected to be linked to disease development. The abundance of experimental
data now enables the identification of features of gene expression profiles
that are shared across tissues, and those that are tissue-specific. While most
current research is concerned with characterising differential expression by
comparing mean expression profiles across tissues, it is also believed that a
significant difference in a gene expression's variance across tissues may also
be associated to molecular mechanisms that are important for tissue development
and function. We propose a sparse multi-view matrix factorisation (sMVMF)
algorithm to jointly analyse gene expression measurements in multiple tissues,
where each tissue provides a different "view" of the underlying organism. The
proposed methodology can be interpreted as an extension of principal component
analysis in that it provides the means to decompose the total sample variance
in each tissue into the sum of two components: one capturing the variance that
is shared across tissues, and one isolating the tissue-specific variances.
sMVMF has been used to jointly model mRNA expression profiles in three tissues
- adipose, skin and LCL - which are available for a large and well-phenotyped
twins cohort, TwinsUK. Using sMVMF, we are able to prioritise genes based on
whether their variation patterns are specific to each tissue. Furthermore,
using DNA methylation profiles available, we provide supporting evidence that
adipose-specific gene expression patterns may be driven by epigenetic effects.Comment: in Bioinformatics 201
Recommended from our members
ARACNE: An Algorithm for the Reconstruction of Gene Regulatory Networks in a Mammalian Cellular Context
Elucidating gene regulatory networks is crucial for understanding normal cell physiology and complex pathologic phenotypes. Existing computational methods for the genome-wide "reverse engineering" of such networks have been successful only for lower eukaryotes with simple genomes. Here we present ARACNE, a novel algorithm, using microarray expression profiles, specifically designed to scale up to the complexity of regulatory networks in mammalian cells, yet general enough to address a wider range of network deconvolution problems. This method uses an information theoretic approach to eliminate the majority of indirect interactions inferred by co-expression methods.
We prove that ARACNE reconstructs the network exactly (asymptotically) if the effect of loops in the network topology is negligible, and we show that the algorithm works well in practice, even in the presence of numerous loops and complex topologies. We assess ARACNE's ability to reconstruct transcriptional regulatory networks using both a realistic synthetic dataset and a microarray dataset from human B cells. On synthetic datasets ARACNE achieves very low error rates and outperforms established methods, such as Relevance Networks and Bayesian Networks. Application to the deconvolution of genetic networks in human B cells demonstrates ARACNE's ability to infer validated transcriptional targets of the cMYC proto-oncogene. We also study the effects of misestimation of mutual information on network reconstruction, and show that algorithms based on mutual information ranking are more resilient to estimation errors.
ARACNE shows promise in identifying direct transcriptional interactions in mammalian cellular networks, a problem that has challenged existing reverse engineering algorithms. This approach should enhance our ability to use microarray data to elucidate functional mechanisms that underlie cellular processes and to identify molecular targets of pharmacological compounds in mammalian cellular networks
GNGS: An Artificial Intelligent Tool for Generating and Analyzing Gene Networks from Microarray Data
- ā¦