Construction of a Boolean model of gene and protein regulatory network with memory

Authors:
Meng Yang;Rui Li;Tianguang Chu
Affiliations:
-;-;-
Venue:
Neural Networks
Year:
2014

Citing 10
Cited 0

Generating Boolean networks with a prescribed attractor structure

Bioinformatics
Synchronous versus asynchronous modeling of gene regulatory networks

Bioinformatics
Controllability and observability of Boolean control networks

Automatica (Journal of IFAC)
An efficient method for dynamic analysis of gene regulatory networks and in silico gene perturbation experiments

RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
Generating probabilistic Boolean networks from a prescribed stationary distribution

Information Sciences: an International Journal
State reduction for network intervention in probabilistic Boolean networks

Bioinformatics
A remark on "Scalar equations for synchronous Boolean networks with biological Applications" by C. Farrow, J. Heidel, J. Maloney, and J. Rogers

IEEE Transactions on Neural Networks
Model Construction of Boolean Network via Observed Data

IEEE Transactions on Neural Networks
Neural networks letter: Controllability and optimal control of a temporal Boolean network

Neural Networks
A new approach for global controllability of higher order Boolean control network

Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Boolean model of gene and protein regulatory network with memory (GPBN) has recently attracted interest as a generalization of original random Boolean networks (BNs) for genetic and cellular networks. It is better suited to describe experimental data from the time-course microarray. Addressing construction problems in GPBNs may lead to a better understanding of the intrinsic dynamics in biological systems. Using the technique of the semi-tensor product (STP) of matrices, the dynamics of a GPBN can be expressed in an algebraic form and the attractors can be calculated. This paper investigates the issue of construction of GPBNs from prescribed attractors. Based on a rigorous theoretical analysis, some algebraic formulae and a computationally feasible algorithm are obtained to construct the least in-degree model with prescribed attractors. Illustrative examples are presented to show the validity of the theoretical results and the proposed algorithm.