Polynomial models of gene dynamics

Authors:
Saadia Faisal;Gerwald Lichtenberg;Herbert Werner
Affiliations:
Institute of Control Systems, Hamburg University of Technology, Eissendorferstrasse 40, AB 2-04 Harburg, Hamburg, Germany;Institute of Control Systems, Hamburg University of Technology, Eissendorferstrasse 40, AB 2-04 Harburg, Hamburg, Germany;Institute of Control Systems, Hamburg University of Technology, Eissendorferstrasse 40, AB 2-04 Harburg, Hamburg, Germany
Venue:
Neurocomputing
Year:
2008

Citing 5
Cited 2

Identification of gene regulatory networks by strategic gene disruptions and gene overexpressions

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On Learning Gene Regulatory Networks Under the Boolean Network Model

Machine Learning
Analyzing time series gene expression data

Bioinformatics
A new dynamic Bayesian network (DBN) approach for identifying gene regulatory networks from time course microarray data

Bioinformatics
A stochastic differential equation model for quantifying transcriptional regulatory network in Saccharomyces cerevisiae

Bioinformatics

Brief paper: Structural properties of continuous representations of Boolean functions for gene network modelling

Automatica (Journal of IFAC)
Quantifying Dynamic Stability of Genetic Memory Circuits

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Through microarray technology a large amount of gene expression data is available for analysis. Different approaches to modeling have been proposed. It has been observed that genetic regulatory networks share many characteristics with Boolean networks such as periodicity, self-organization, etc. Moreover, it is also a known fact that in these networks, most genes are governed by Canalizing Boolean functions. However, the actual gene expression level measurements are continuous valued. To combine discrete and continuous aspects, Zhegalkin Polynomials can be used as continuous representations of Boolean functions. The requirement for the Boolean function to be canalizing can be extended to continuous functions by demanding monotonicity with respect to at least the canalizing variable. In this paper it is proven that Canalizing Zhegalkin Polynomials observe this monotonicity property. Moreover, for correct handling of normalized data it is shown that the value of a Zhegalkin Polynomial also lies within the unit interval as long as the values of its input variables also do so.