Simplification of Boolean networks in general.
<p>In panel (A) is presented the Boolean network (E. 13) with its computational solution calculated with BoolNet [<a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0319240#pone.0319240.ref016" target="_blank">16</a>] and GINSIM [<a href=&q...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Published: |
2025
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | <p>In panel (A) is presented the Boolean network (E. 13) with its computational solution calculated with BoolNet [<a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0319240#pone.0319240.ref016" target="_blank">16</a>] and GINSIM [<a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0319240#pone.0319240.ref017" target="_blank">17</a>]. In panel (B) is presented the Boolean function , obtained by using the logic rules of (E. 13). In panel (C) is shown the transformation of to integers. In panel (D) is presented the function with all their interactions sent directly to the attractor to which they naturally converge, and in panel (E) is shown the conversion of this function to binary numbers. Finally, in panel (F) is shown the network generated from , which corresponds to the network (E. 14). Note that (E. 14) is a simplified version of (E. 13).</p> |
|---|