跳到主要导航 跳到搜索 跳到主要内容

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

  • Beihang University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

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.

源语言英语
主期刊名ISSAC 2025 - Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation
编辑Carlos D'Andrea, Sonia Perez Diaz, Santiago Laplagne
出版商Association for Computing Machinery, Inc
277-283
页数7
ISBN(电子版)9798400720758
DOI
出版状态已出版 - 10 11月 2025
活动50th International Symposium on Symbolic and Algebraic Computation, ISSAC 2025 - Guanajuato, 墨西哥
期限: 28 7月 20251 8月 2025

出版系列

姓名ISSAC 2025 - Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation

会议

会议50th International Symposium on Symbolic and Algebraic Computation, ISSAC 2025
国家/地区墨西哥
Guanajuato
时期28/07/251/08/25

学术指纹

探究 'An Efficient Algorithm for Determining the Equivalence of Zero-one Reaction Networks' 的科研主题。它们共同构成独一无二的学术指纹。

引用此