Absolute concentration robustness: Algebra and geometry

IF 0.6 4区 数学 Q4 COMPUTER SCIENCE, THEORY & METHODS Journal of Symbolic Computation Pub Date : 2024-10-30 DOI:10.1016/j.jsc.2024.102398
Luis David García Puente , Elizabeth Gross , Heather A. Harrington , Matthew Johnston , Nicolette Meshkat , Mercedes Pérez Millán , Anne Shiu
{"title":"Absolute concentration robustness: Algebra and geometry","authors":"Luis David García Puente ,&nbsp;Elizabeth Gross ,&nbsp;Heather A. Harrington ,&nbsp;Matthew Johnston ,&nbsp;Nicolette Meshkat ,&nbsp;Mercedes Pérez Millán ,&nbsp;Anne Shiu","doi":"10.1016/j.jsc.2024.102398","DOIUrl":null,"url":null,"abstract":"<div><div>Motivated by the question of how biological systems maintain homeostasis in changing environments, Shinar and Feinberg introduced in 2010 the concept of absolute concentration robustness (ACR). A biochemical system exhibits ACR in some species if the steady-state value of that species does not depend on initial conditions. Thus, a system with ACR can maintain a constant level of one species even as the initial condition changes. Despite a great deal of interest in ACR in recent years, the following basic question remains open: How can we determine quickly whether a given biochemical system has ACR? Although various approaches to this problem have been proposed, we show that they are incomplete. Accordingly, we present new methods for deciding ACR, which harness computational algebra. We illustrate our results on several biochemical signaling networks.</div></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"128 ","pages":"Article 102398"},"PeriodicalIF":0.6000,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Symbolic Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0747717124001020","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Motivated by the question of how biological systems maintain homeostasis in changing environments, Shinar and Feinberg introduced in 2010 the concept of absolute concentration robustness (ACR). A biochemical system exhibits ACR in some species if the steady-state value of that species does not depend on initial conditions. Thus, a system with ACR can maintain a constant level of one species even as the initial condition changes. Despite a great deal of interest in ACR in recent years, the following basic question remains open: How can we determine quickly whether a given biochemical system has ACR? Although various approaches to this problem have been proposed, we show that they are incomplete. Accordingly, we present new methods for deciding ACR, which harness computational algebra. We illustrate our results on several biochemical signaling networks.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
绝对浓度稳健性代数与几何
受生物系统如何在不断变化的环境中保持平衡这一问题的启发,Shinar 和 Feinberg 于 2010 年提出了绝对浓度稳健性(ACR)的概念。如果一个生化系统中某些物种的稳态值不依赖于初始条件,那么该物种就会表现出 ACR。因此,即使初始条件发生变化,具有 ACR 的系统也能保持某一物种的恒定水平。尽管近年来人们对 ACR 产生了浓厚的兴趣,但以下基本问题仍然悬而未决:我们如何才能快速确定一个特定的生化系统是否具有 ACR?尽管已经提出了解决这一问题的各种方法,但我们发现这些方法并不全面。因此,我们提出了利用计算代数来判断 ACR 的新方法。我们将在几个生化信号网络中说明我们的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Symbolic Computation
Journal of Symbolic Computation 工程技术-计算机:理论方法
CiteScore
2.10
自引率
14.30%
发文量
75
审稿时长
142 days
期刊介绍: An international journal, the Journal of Symbolic Computation, founded by Bruno Buchberger in 1985, is directed to mathematicians and computer scientists who have a particular interest in symbolic computation. The journal provides a forum for research in the algorithmic treatment of all types of symbolic objects: objects in formal languages (terms, formulas, programs); algebraic objects (elements in basic number domains, polynomials, residue classes, etc.); and geometrical objects. It is the explicit goal of the journal to promote the integration of symbolic computation by establishing one common avenue of communication for researchers working in the different subareas. It is also important that the algorithmic achievements of these areas should be made available to the human problem-solver in integrated software systems for symbolic computation. To help this integration, the journal publishes invited tutorial surveys as well as Applications Letters and System Descriptions.
期刊最新文献
Computing component groups of stabilizers of nilpotent orbit representatives Editorial Board Computing the homology of universal covers via effective homology and discrete vector fields Local dual spaces and primary decomposition On the existence and convergence of formal power series solutions of nonlinear Mahler equations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1