Abstract: Cellular complexity stems from the interactions
among thousands of different molecular species. Thanks to the
emerging fields of systems and synthetic biology, scientists are
beginning to unravel these regulatory, signaling, and metabolic
interactions and to understand their coordinated action. Reverse
engineering of biological networks has has several benefits but a
poor quality of data combined with the difficulty in reproducing
it limits the applicability of these methods. A few years back,
many of the commonly used predictive algorithms were tested
on a network constructed in the yeast Saccharomyces cerevisiae
(S. cerevisiae) to resolve this issue. The network was a synthetic
network of five genes regulating each other for the so-called in
vivo reverse-engineering and modeling assessment (IRMA). The
network was constructed in S. cereviase since it is a simple and well
characterized organism. The synthetic network included a variety
of regulatory interactions, thus capturing the behaviour of larger
eukaryotic gene networks on a smaller scale. We derive a new set of
algorithms by solving a nonlinear optimization problem and show
how these algorithms outperform other algorithms on these datasets.
Abstract: A DNA microarray technology is a collection of microscopic DNA spots attached to a solid surface. Scientists use DNA microarrays to measure the expression levels of large numbers of genes simultaneously or to genotype multiple regions of a genome. Elucidating the patterns hidden in gene expression data offers a tremendous opportunity for an enhanced understanding of functional genomics. However, the large number of genes and the complexity of biological networks greatly increase the challenges of comprehending and interpreting the resulting mass of data, which often consists of millions of measurements. It is handled by clustering which reveals the natural structures and identifying the interesting patterns in the underlying data. In this paper, gene based clustering in gene expression data is proposed using Cuckoo Search with Differential Evolution (CS-DE). The experiment results are analyzed with gene expression benchmark datasets. The results show that CS-DE outperforms CS in benchmark datasets. To find the validation of the clustering results, this work is tested with one internal and one external cluster validation indexes.
Abstract: Stochastic models of biological networks are well established in systems biology, where the computational treatment of such models is often focused on the solution of the so-called chemical master equation via stochastic simulation algorithms. In contrast to this, the development of storage-efficient model representations that are directly suitable for computer implementation has received significantly less attention. Instead, a model is usually described in terms of a stochastic process or a "higher-level paradigm" with graphical representation such as e.g. a stochastic Petri net. A serious problem then arises due to the exponential growth of the model-s state space which is in fact a main reason for the popularity of stochastic simulation since simulation suffers less from the state space explosion than non-simulative numerical solution techniques. In this paper we present transition class models for the representation of biological network models, a compact mathematical formalism that circumvents state space explosion. Transition class models can also serve as an interface between different higher level modeling paradigms, stochastic processes and the implementation coded in a programming language. Besides, the compact model representation provides the opportunity to apply non-simulative solution techniques thereby preserving the possible use of stochastic simulation. Illustrative examples of transition class representations are given for an enzyme-catalyzed substrate conversion and a part of the bacteriophage λ lysis/lysogeny pathway.