加成反应系统的定点和吸引子

IF 1.7 4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Rocco Ascone, Giulia Bernardini, Luca Manzoni
{"title":"加成反应系统的定点和吸引子","authors":"Rocco Ascone, Giulia Bernardini, Luca Manzoni","doi":"10.1007/s11047-024-09977-2","DOIUrl":null,"url":null,"abstract":"<p>Reaction systems are discrete dynamical systems that simulate biological processes within living cells through finite sets of reactants, inhibitors, and products. In this paper, we study the computational complexity of deciding on the existence of fixed points and attractors in the restricted class of additive reaction systems, in which each reaction involves at most one reactant and no inhibitors. We prove that all the considered problems, that are known to be hard for other classes of reaction systems, are polynomially solvable in additive systems. To arrive at these results, we provide several non-trivial reductions to problems on a polynomially computable graph representation of reaction systems that might prove useful for addressing other related problems in the future.</p>","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":"46 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fixed points and attractors of additive reaction systems\",\"authors\":\"Rocco Ascone, Giulia Bernardini, Luca Manzoni\",\"doi\":\"10.1007/s11047-024-09977-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Reaction systems are discrete dynamical systems that simulate biological processes within living cells through finite sets of reactants, inhibitors, and products. In this paper, we study the computational complexity of deciding on the existence of fixed points and attractors in the restricted class of additive reaction systems, in which each reaction involves at most one reactant and no inhibitors. We prove that all the considered problems, that are known to be hard for other classes of reaction systems, are polynomially solvable in additive systems. To arrive at these results, we provide several non-trivial reductions to problems on a polynomially computable graph representation of reaction systems that might prove useful for addressing other related problems in the future.</p>\",\"PeriodicalId\":49783,\"journal\":{\"name\":\"Natural Computing\",\"volume\":\"46 1\",\"pages\":\"\"},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2024-03-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Natural Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s11047-024-09977-2\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Natural Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11047-024-09977-2","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

反应系统是一种离散动态系统,它通过反应物、抑制剂和产物的有限集合来模拟活细胞内的生物过程。在本文中,我们研究了在受限制的加法反应系统中决定定点和吸引子存在的计算复杂性,在这类反应系统中,每个反应最多涉及一个反应物,没有抑制剂。我们证明,所考虑的所有问题,对于其他类别的反应系统都是已知的难题,而在加法系统中都是多项式可解的。为了得出这些结果,我们提供了反应系统多项式可计算图表示上的几个非难还原问题,这些问题将来可能会被证明有助于解决其他相关问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Fixed points and attractors of additive reaction systems

Fixed points and attractors of additive reaction systems

Reaction systems are discrete dynamical systems that simulate biological processes within living cells through finite sets of reactants, inhibitors, and products. In this paper, we study the computational complexity of deciding on the existence of fixed points and attractors in the restricted class of additive reaction systems, in which each reaction involves at most one reactant and no inhibitors. We prove that all the considered problems, that are known to be hard for other classes of reaction systems, are polynomially solvable in additive systems. To arrive at these results, we provide several non-trivial reductions to problems on a polynomially computable graph representation of reaction systems that might prove useful for addressing other related problems in the future.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Natural Computing
Natural Computing Computer Science-Computer Science Applications
CiteScore
4.40
自引率
4.80%
发文量
49
审稿时长
3 months
期刊介绍: The journal is soliciting papers on all aspects of natural computing. Because of the interdisciplinary character of the journal a special effort will be made to solicit survey, review, and tutorial papers which would make research trends in a given subarea more accessible to the broad audience of the journal.
×
引用
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学术官方微信