Abstract:
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.
Fulltext:
PDF file (524 kB)