Conference paper ยท Book chapter
Reducing Boolean Networks with Backward Boolean Equivalence
Boolean Networks (BNs) are established models to qualitatively describe biological systems. The analysis of BNs might be infeasible for medium to large BNs due to the state-space explosion problem. We propose a novel reduction technique called \emph{Backward Boolean Equivalence} (BBE), which preserves some properties of interest of BNs.
In particular, reduced BNs provide a compact representation by grouping variables that, if initialized equally, are always updated equally. The resulting reduced state space is a subset of the original one, restricted to identical initialization of grouped variables. The corresponding trajectories of the original BN can be exactly restored.
We show the effectiveness of BBE by performing a large-scale validation on the whole GINsim BN repository. In selected cases, we show how our method enables analyses that would be otherwise intractable. Our method complements, and can be combined with, other reduction methods found in the literature.
Language: | English |
---|---|
Publisher: | Springer |
Year: | 2021 |
Pages: | 1-18 |
Proceedings: | 19<sup>th</sup> International Conference on Computational Methods in Systems Biology<br/> |
Series: | Lecture Notes in Computer Science |
ISBN: | 3030856321 , 303085633X , 303085633x , 9783030856328 and 9783030856335 |
ISSN: | 03029743 and 16113349 |
Types: | Conference paper and Book chapter |
DOI: | 10.1007/978-3-030-85633-5_1 |
ORCIDs: | Lafuente, Alberto Lluch and Vandin, Andrea |
Attractor analysis Boolean Network Exact Reduction GinSim Repository State Transition Graph
Boolean network Exact reduction Ginsim repository State transition graph