Skip to main navigation Skip to search Skip to main content

An Efficient Algorithm for Determining the Equivalence of Zero-one Reaction Networks

  • Beihang University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Zero-one reaction networks play a crucial role in cell signaling. Determining the equivalence of reaction networks is a fundamental computational problem in the field of chemical reaction networks. In this work, we develop an efficient method for determining the equivalence of zero-one networks. The efficiency comes from several criteria for determining the equivalence of the steady-state ideals arising from zero-one networks, which helps for cutting down the expenses on computing Gröbner bases. Experiments show that our method can successfully classify over three million networks according to their equivalence in a reasonable time.

Original languageEnglish
Title of host publicationISSAC 2025 - Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation
EditorsCarlos D'Andrea, Sonia Perez Diaz, Santiago Laplagne
PublisherAssociation for Computing Machinery, Inc
Pages277-283
Number of pages7
ISBN (Electronic)9798400720758
DOIs
StatePublished - 10 Nov 2025
Event50th International Symposium on Symbolic and Algebraic Computation, ISSAC 2025 - Guanajuato, Mexico
Duration: 28 Jul 20251 Aug 2025

Publication series

NameISSAC 2025 - Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation

Conference

Conference50th International Symposium on Symbolic and Algebraic Computation, ISSAC 2025
Country/TerritoryMexico
CityGuanajuato
Period28/07/251/08/25

Keywords

  • Chemical reaction network
  • Gröbner basis
  • Steady-state ideal

Fingerprint

Dive into the research topics of 'An Efficient Algorithm for Determining the Equivalence of Zero-one Reaction Networks'. Together they form a unique fingerprint.

Cite this