TY - JOUR T1 - Finite-state discrete-time Markov chain models of gene regulatory networks JF - bioRxiv DO - 10.1101/006361 SP - 006361 AU - V.P. Skornyakov AU - M.V. Skornyakova AU - A.V. Shurygina AU - P.V. Skornyakov Y1 - 2014/01/01 UR - http://biorxiv.org/content/early/2014/06/23/006361.abstract N2 - In this study Markov chain models of gene regulatory networks (GRN) are developed. These models gives the ability to apply the well known theory and tools of Markov chains to GRN analysis. We introduce a new kind of the finite graph of the interactions called the combinatorial net that formally represent a GRN and the transition graphs constructed from interaction graphs. System dynamics are defined as a random walk on the transition graph that is some Markovian chain. A novel concurrent updating scheme (evolution rule) is developed to determine transitions in a transition graph. Our scheme is based on the firing of a random set of non-steady state vertices of a combinatorial net. We demonstrate that this novel scheme gives an advance in the modeling of the asynchronicity. Also we proof the theorem that the combinatorial nets with this updating scheme can asynchronously compute a maximal independent sets of graphs. As proof of concept, we present here a number of simple combinatorial models: a discrete model of auto-repression, a bi-stable switch, the Elowitz repressilator, a self-activation and show that this models exhibit well known properties. ER -