Enabling equivalence and its cover relation for reaction systems

Abstract A reaction system consists of a background set of entities and a set of reactions. Reactions are specified by three sets of entities: reactants, inhibitors, and products. A reaction is enabled by a state (a subset of entities), if all its reactants are present in that state and none of its inhibitors. The result of a set of reactions on a given state is a new state that consists of the products of the reactions that were enabled at the original state. In this paper, we further investigate enabling equivalence. This relation equates two sets of reactions for which the states that enable all their reactions simultaneously, are the same and, moreover, their results on those states are the same. From the point of view of enabling equivalence, sets of reactions act as if they were a single (combined) reaction. We show how combined reactions characterize enabling equivalence classes. Furthermore, enabling equivalence induces a partial order in the form of a cover relation on its equivalence classes. The resulting partially ordered set turns out to be a lattice and we demonstrate how this lattice relates to the enabling cover relation introduced earlier for single reactions.

Authors

Institutions

Publication Details

Journal
Natural Computing
Published
2025-06-30
DOI
https://doi.org/10.1007/s11047-025-10033-w
Primary Topic
Gene Regulatory Network Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enabling equivalence and its cover relation for reaction systems

Jetty Kleijn, Daniela Genova, Hendrik Jan Hoogeboom
Natural Computing
Gene Regulatory Network Analysis
article

Enabling equivalence and its cover relation for reaction systems

Jetty Kleijn, Daniela Genova, Hendrik Jan Hoogeboom
article en

Abstract

Abstract A reaction system consists of a background set of entities and a set of reactions. Reactions are specified by three sets of entities: reactants, inhibitors, and products. A reaction is enabled by a state (a subset of entities), if all its reactants are present in that state and none of its inhibitors. The result of a set of reactions on a given state is a new state that consists of the products of the reactions that were enabled at the original state. In this paper, we further investigate enabling equivalence. This relation equates two sets of reactions for which the states that enable all their reactions simultaneously, are the same and, moreover, their results on those states are the same. From the point of view of enabling equivalence, sets of reactions act as if they were a single (combined) reaction. We show how combined reactions characterize enabling equivalence classes. Furthermore, enabling equivalence induces a partial order in the form of a cover relation on its equivalence classes. The resulting partially ordered set turns out to be a lattice and we demonstrate how this lattice relates to the enabling cover relation introduced earlier for single reactions.

Natural ComputingVol. 24(3)
University of North Florida (US), Leiden University (NL), University of Applied Sciences Leiden (NL)
Openalex Percentile: Top 86%
Gene Regulatory Network Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Enabling equivalence and its cover relation for reaction systems — Jetty Kleijn, Daniela Genova, et al. · Natural Computing (2025) | TGRS Research Map | TGRS