scholarly journals State Space Model with hidden variables for reconstruction of gene regulatory networks

2011 ◽  
Vol 5 (Suppl 3) ◽  
pp. S3 ◽  
Author(s):  
Xi Wu ◽  
Peng Li ◽  
Nan Wang ◽  
Ping Gong ◽  
Edward J Perkins ◽  
...  
Mathematics ◽  
2021 ◽  
Vol 9 (16) ◽  
pp. 1908
Author(s):  
Ourania Theodosiadou ◽  
George Tsaklidis

State space model representation is widely used for the estimation of nonobservable (hidden) random variables when noisy observations of the associated stochastic process are available. In case the state vector is subject to constraints, the standard Kalman filtering algorithm can no longer be used in the estimation procedure, since it assumes the linearity of the model. This kind of issue is considered in what follows for the case of hidden variables that have to be non-negative. This restriction, which is common in many real applications, can be faced by describing the dynamic system of the hidden variables through non-negative definite quadratic forms. Such a model could describe any process where a positive component represents “gain”, while the negative one represents “loss”; the observation is derived from the difference between the two components, which stands for the “surplus”. Here, a thorough analysis of the conditions that have to be satisfied regarding the existence of non-negative estimations of the hidden variables is presented via the use of the Karush–Kuhn–Tucker conditions.


2016 ◽  
Vol 13 (120) ◽  
pp. 20160179 ◽  
Author(s):  
S. E. Ahnert ◽  
T. M. A. Fink

Network motifs have been studied extensively over the past decade, and certain motifs, such as the feed-forward loop, play an important role in regulatory networks. Recent studies have used Boolean network motifs to explore the link between form and function in gene regulatory networks and have found that the structure of a motif does not strongly determine its function, if this is defined in terms of the gene expression patterns the motif can produce. Here, we offer a different, higher-level definition of the ‘function’ of a motif, in terms of two fundamental properties of its dynamical state space as a Boolean network. One is the basin entropy, which is a complexity measure of the dynamics of Boolean networks. The other is the diversity of cyclic attractor lengths that a given motif can produce. Using these two measures, we examine all 104 topologically distinct three-node motifs and show that the structural properties of a motif, such as the presence of feedback loops and feed-forward loops, predict fundamental characteristics of its dynamical state space, which in turn determine aspects of its functional versatility. We also show that these higher-level properties have a direct bearing on real regulatory networks, as both basin entropy and cycle length diversity show a close correspondence with the prevalence, in neural and genetic regulatory networks, of the 13 connected motifs without self-interactions that have been studied extensively in the literature.


2009 ◽  
Vol 2009 ◽  
pp. 1-14 ◽  
Author(s):  
Chushin Koh ◽  
Fang-Xiang Wu ◽  
Gopalan Selvaraj ◽  
Anthony J. Kusalik

2006 ◽  
Vol 22 (6) ◽  
pp. 747-754 ◽  
Author(s):  
Z. Li ◽  
S. M. Shaw ◽  
M. J. Yedwabnick ◽  
C. Chan

Sign in / Sign up

Export Citation Format

Share Document