Identification of Boolean control networks
โ Scribed by Daizhan Cheng; Yin Zhao
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 355 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0005-1098
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper the identification of Boolean control networks is addressed. First, necessary and sufficient conditions are obtained for the identification of state equation from input-state data. Then a necessary and sufficient condition for a controllable Boolean network to be observable is presented. Based on these two results, a necessary and sufficient condition for the identification from input-output data is achieved. To practically identify the model, a numerical algorithm is proposed. Two particular cases: (i) identification of systems with a known network graph; (ii) identification of a higher order Boolean network, are also investigated. Finally, the approximate identification for large size networks is explored.
๐ SIMILAR VOLUMES
This paper investigates the controllability of Boolean networks with time-invariant delays in states. After a brief introduction on converting the logic dynamics to discrete time delay systems, the controllability via two kinds of controls is studied. One kind of control is generated by Boolean cont
The remarkably stable dynamics displayed by randomly constructed Boolean networks is one of the most striking examples of the spontaneous emergence of self-organization in model systems composed of many interacting elements (Kauffman, S., J. theor. Biol.22, 437-467, 1969; The Origins of Order, Oxfor
Analysis of the interactions between genes by systematic gene disruptions and gene overexpressions is an important topic in molecular biology. This paper analyses the problem of identifying a genetic network from the data obtained by multiple gene disruptions and overexpressions in regard to the num