Reducing Boolean networks with backward Boolean equivalence
From MaRDI portal
Publication:2142096
DOI10.1007/978-3-030-85633-5_1zbMath1491.92058arXiv2106.15476OpenAlexW3184130079MaRDI QIDQ2142096
Andrea Vandin, Mirco Tribastone, Max Tschaikowski, Alberto Lluch Lafuente, Georgios Argyris
Publication date: 25 May 2022
Full work available at URL: https://arxiv.org/abs/2106.15476
Related Items (2)
A large-scale assessment of exact lumping of quantitative models in the biomodels repository ⋮ An extension of ERODE to reduce Boolean networks by backward Boolean equivalence
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamically consistent reduction of logical regulatory graphs
- Petri net modelling of biological regulatory networks
- Reduction of Boolean network models
- A large-scale assessment of exact lumping of quantitative models in the biomodels repository
- Attractors in Boolean networks: a tutorial
- Efficient syntax-driven lumping of differential equations
- A large-scale assessment of exact model reduction in the biomodels repository
- Comparing chemical reaction networks: a categorical and algorithmic perspective
- An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks
- Dynamical modeling and analysis of large cellular regulatory networks
- Relating Bisimulations with Attractors in Boolean Network Models
- A Reduction Method for Boolean Network Models Proven to Conserve Attractors
- SIMPLIFYING BOOLEAN NETWORKS
- Three Partition Refinement Algorithms
- Comparing Chemical Reaction Networks
- Forward and Backward Bisimulations for Chemical Reaction Networks
- Symbolic computation of differential equivalences
- Symbolic computation of differential equivalences
This page was built for publication: Reducing Boolean networks with backward Boolean equivalence
