Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components
To simplify the analysis of Boolean networks, a reduction in the number of components is often considered. A popular reduction method consists in eliminating components that are not autoregulated, using variable substitution. In this work, we show how this method can be extended, for asynchronous dy...
Saved in:
| Main Authors: | Robert Schwieger, Elisa Tonello |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2024-03-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | http://dmtcs.episciences.org/10930/pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the parameterized complexity of computing tree-partitions
by: Hans L. Bodlaender, et al.
Published: (2025-02-01) -
Phenotype control and elimination of variables in Boolean networks
by: Tonello, Elisa, et al.
Published: (2024-08-01) -
Treewidth 2 in the Planar Graph Product Structure Theorem
by: Marc Distel, et al.
Published: (2025-03-01) -
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
by: Laurent Beaudou, et al.
Published: (2024-04-01) -
Bears with Hats and Independence Polynomials
by: Václav Blažej, et al.
Published: (2023-10-01)