Properties of gene networks with threshold functions
Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 72-73
Cet article a éte moissonné depuis la source Math-Net.Ru
An algorithm for finding all fixed points of the state graph of a circulant type gene network transformed by a Boolean function is given. All sources of the state graph of a gene network transformed by a threshold Boolean function in $k$ variables with a single value 1 are described. In case $k=3$ all circles of the state graph are described too, and the length of the maximum chain in it is calculated.
Keywords:
gene network, directed graph, threshold functions, state graph of mapping, fixed point, source of state graph.
@article{PDMA_2013_6_a32,
author = {T. Batueva},
title = {Properties of gene networks with threshold functions},
journal = {Prikladnaya Diskretnaya Matematika. Supplement},
pages = {72--73},
year = {2013},
number = {6},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDMA_2013_6_a32/}
}
T. Batueva. Properties of gene networks with threshold functions. Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 72-73. http://geodesic.mathdoc.fr/item/PDMA_2013_6_a32/
[1] Evdokimov A. A., Likhovidova E. O., “Diskretnaya model gennoi seti tsirkulyantnogo tipa s porogovymi funktsiyami”, Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaya tekhnika i informatika, 2008, no. 2(3), 18–21 | MR