An Extension of ERODE to Reduce Boolean Networks By Backward Boolean Equivalence

Georgios Argyris, Alberto Lluch Lafuente, Mirco Tribastone, Max Tschaikowski, Andrea Vandin*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

84 Downloads (Pure)

Abstract

Boolean Networks (BN) are established tools for modelling biological systems. However, their analysis is hindered by the state space explosion: the exponentially many states on the variables of a BN. We present an extension of the tool for model reduction ERODE with support for BNs and their reduction with a recent method called Backward Boolean Equivalence (BBE). BBE identifies maximal sets of variables that retain the same value whenever initialized equally. ERODE has been also extended to support importing and exporting between different formats and model repositories, enhancing interoperability with other tools.

Original languageEnglish
Title of host publicationProceedings of 20th International Conference Computational Methods in Systems Biology
EditorsIon Petre, Andrei Păun
PublisherSpringer
Publication date2022
Pages294-301
ISBN (Print)9783031150333
DOIs
Publication statusPublished - 2022
Event20th International Conference on Computational Methods in Systems Biology - University of Bucharest, Bucharest, Romania
Duration: 14 Sept 202216 Sept 2022

Conference

Conference20th International Conference on Computational Methods in Systems Biology
LocationUniversity of Bucharest
Country/TerritoryRomania
CityBucharest
Period14/09/202216/09/2022
SeriesLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13447 LNBI
ISSN0302-9743

Keywords

  • Backward Equivalence
  • Boolean Network
  • Reduction

Fingerprint

Dive into the research topics of 'An Extension of ERODE to Reduce Boolean Networks By Backward Boolean Equivalence'. Together they form a unique fingerprint.

Cite this