生化网络的鲁棒性:循序渐进的方法

IF 0.9 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Valentina Castiglioni , Ruggero Lanotte , Michele Loreti , Desiree Manicardi , Simone Tini
{"title":"生化网络的鲁棒性:循序渐进的方法","authors":"Valentina Castiglioni ,&nbsp;Ruggero Lanotte ,&nbsp;Michele Loreti ,&nbsp;Desiree Manicardi ,&nbsp;Simone Tini","doi":"10.1016/j.tcs.2024.114934","DOIUrl":null,"url":null,"abstract":"<div><div>We propose two step-by-step approaches to the analysis of robustness in biochemical networks. Our aim is to measure the ability of the network to exhibit step-by-step limited variations on the concentration of a species of interest at varying of the initial concentration of other species. The first approach we propose is reaction-by-reaction, i.e. we compare the states reached by nominal and perturbed networks after they have performed the same number of reactions. We provide a statistical technique allowing for estimating robustness, we implement it in a tool called <span>spebnr</span> (<em>a Simple Python Environment for statistical estimation of Biochemical Network Robustness</em>) and showcase it on three case studies: the EnvZ/OmpR osmoregulatory signaling system of Escherichia Coli, the mechanism of bacterial chemotaxis of Escherichia Coli, and enzyme activity at saturation. Then, we consider a time-by-time approach, in which networks are compared on the basis of the states they reached at the same time point, regardless of how many reactions occurred. This approach is implemented in <span>Stark</span>, and we apply it to the study the robustness of the EnvZ/OmpR osmoregulatory signaling system and the Lotka-Volterra equations.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1022 ","pages":"Article 114934"},"PeriodicalIF":0.9000,"publicationDate":"2024-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Robustness for biochemical networks: Step-by-step approach\",\"authors\":\"Valentina Castiglioni ,&nbsp;Ruggero Lanotte ,&nbsp;Michele Loreti ,&nbsp;Desiree Manicardi ,&nbsp;Simone Tini\",\"doi\":\"10.1016/j.tcs.2024.114934\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>We propose two step-by-step approaches to the analysis of robustness in biochemical networks. Our aim is to measure the ability of the network to exhibit step-by-step limited variations on the concentration of a species of interest at varying of the initial concentration of other species. The first approach we propose is reaction-by-reaction, i.e. we compare the states reached by nominal and perturbed networks after they have performed the same number of reactions. We provide a statistical technique allowing for estimating robustness, we implement it in a tool called <span>spebnr</span> (<em>a Simple Python Environment for statistical estimation of Biochemical Network Robustness</em>) and showcase it on three case studies: the EnvZ/OmpR osmoregulatory signaling system of Escherichia Coli, the mechanism of bacterial chemotaxis of Escherichia Coli, and enzyme activity at saturation. Then, we consider a time-by-time approach, in which networks are compared on the basis of the states they reached at the same time point, regardless of how many reactions occurred. This approach is implemented in <span>Stark</span>, and we apply it to the study the robustness of the EnvZ/OmpR osmoregulatory signaling system and the Lotka-Volterra equations.</div></div>\",\"PeriodicalId\":49438,\"journal\":{\"name\":\"Theoretical Computer Science\",\"volume\":\"1022 \",\"pages\":\"Article 114934\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-10-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theoretical Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0304397524005516\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397524005516","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

我们提出了两种逐步分析生化网络鲁棒性的方法。我们的目的是测量网络在其他物种初始浓度变化时,对相关物种浓度进行逐步有限变化的能力。我们提出的第一种方法是逐个反应法,即比较名义网络和受扰动网络在进行相同数量的反应后所达到的状态。我们提供了一种可以估算鲁棒性的统计技术,并在一个名为 spebnr(用于统计估算生化网络鲁棒性的简单 Python 环境)的工具中实现了这一技术,并在三个案例研究中进行了展示:大肠杆菌的 EnvZ/OmpR 渗透信号系统、大肠杆菌的细菌趋化机制以及饱和状态下的酶活性。然后,我们考虑采用逐时方法,根据网络在同一时间点达到的状态进行比较,而不管发生了多少反应。我们在斯塔克中实现了这种方法,并将其用于研究 EnvZ/OmpR 渗透信号系统和 Lotka-Volterra 方程的鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Robustness for biochemical networks: Step-by-step approach
We propose two step-by-step approaches to the analysis of robustness in biochemical networks. Our aim is to measure the ability of the network to exhibit step-by-step limited variations on the concentration of a species of interest at varying of the initial concentration of other species. The first approach we propose is reaction-by-reaction, i.e. we compare the states reached by nominal and perturbed networks after they have performed the same number of reactions. We provide a statistical technique allowing for estimating robustness, we implement it in a tool called spebnr (a Simple Python Environment for statistical estimation of Biochemical Network Robustness) and showcase it on three case studies: the EnvZ/OmpR osmoregulatory signaling system of Escherichia Coli, the mechanism of bacterial chemotaxis of Escherichia Coli, and enzyme activity at saturation. Then, we consider a time-by-time approach, in which networks are compared on the basis of the states they reached at the same time point, regardless of how many reactions occurred. This approach is implemented in Stark, and we apply it to the study the robustness of the EnvZ/OmpR osmoregulatory signaling system and the Lotka-Volterra equations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Theoretical Computer Science
Theoretical Computer Science 工程技术-计算机:理论方法
CiteScore
2.60
自引率
18.20%
发文量
471
审稿时长
12.6 months
期刊介绍: Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信