Simplification of networks that only have cyclic attractors.

<p>In panel (A) is shown the result of using the network (E. 11) to generate a Boolean function . In panel (B) is shown the conversion of to integers, where pink lines indicate all trajectories that converge to cyclic attractor {2, 3}. In panel (C) is presented the network (E. 11) together wit...

Full description

Saved in:

Bibliographic Details
Main Author:	Antonio Bensussen (5800739) (author)
Other Authors:	J. Arturo Arciniega-González (22238618) (author), Elena R. Álvarez-Buylla (3265740) (author), Juan Carlos Martínez-García (3755350) (author)
Published:	2025
Subjects:	Genetics Developmental Biology Cancer Computational Biology Biological Sciences not elsewhere classified Mathematical Sciences not elsewhere classified Physical Sciences not elsewhere classified xlink "> characterizing produce characteristic properties asynchronous scheme generates dynamical properties found canonical form might asynchronous update schemes solve boolean networks biological systems modeled synchronous update scheme update schemes canonical form boolean networks update order biological system boolean network synchronous scheme point attractors particular case new possibilities matrix equation mathematical terms markov chains kolmogorov equation composed together analytical approach also discovered
Tags:	Add Tag No Tags, Be the first to tag this record!

Simplification of networks that only have cyclic attractors.

Similar Items