Analysis of discrete automaton models of gene networks with irregular structure using symbolic algorithms

We introduce and analyze discrete-automaton models of gene networks where weight functions of vertices take into account various forms of regulatory activity of agents. Within the model, we analyze a discrete mapping specified by a fragment of the gene network of E.coli. For this mapping, we found a number of fixed points using SAT-approach. Also we analyze mappings specified by random graphs generated according to Gilbert–Erdos–Renyi and Watts–Strogatz models. For these mappings, it was possible to find fixed points and cycles of length 2 and 3. This work can be considered as a review of our recent results regarding discrete models of gene networks and symbolic methods of analysis of their functioning. Ill. 6, tab. 2, bibliogr. 27.