Using Partition Information Entropy to Computationally Rank Order Critical Subreactions in a Petri Net Model of a Biochemical Signaling Network.

IF 1.4 4区 生物学 Q4 BIOCHEMICAL RESEARCH METHODS
Janet B Jones-Oliveira, Hans-Joseph B Oliveira, Joseph S Oliveira, David A Dixon
{"title":"Using Partition Information Entropy to Computationally Rank Order Critical Subreactions in a Petri Net Model of a Biochemical Signaling Network.","authors":"Janet B Jones-Oliveira, Hans-Joseph B Oliveira, Joseph S Oliveira, David A Dixon","doi":"10.1089/cmb.2024.0849","DOIUrl":null,"url":null,"abstract":"<p><p>Improved computational methods to analyze the mathematical structure and function of biochemical networks are needed when the biomolecular connectivity is known but when a complete set of the equilibrium and rate constants may not be available. We use Petri nets, which are equivalently bipartite digraphs, to analyze the rule-based flow of information through the network. We present several computational improvements to Petri net modeling as an aid to improve this approach, previously limited by the combinatorics of network size and complexity. The generation of Petri nets using equations for three elemental stencils (molecular reaction, synthesis complex formation, and decomposition complex formation) has been automated. A set of finite probability measures is defined in terms of a partition information entropy, where the complete listing of unique minimal cycles (UMCs) of the Petri net provides the natural partitioning. This enables the ranking of the UMC listing that covers all possible information flows in the reaction network; the information entropy measure enables the identification of which UMCs are more significant than others. In terms of the information entropy, forward cycles are less surprising and carry less information entropy, whereas backward cycles carry more information entropy and serve as regulators by providing feedback to control the network. As the systems analyzed increase in size and complexity, the automatic rank ordering of the UMCs provides a mechanism to highlight the globally most important information without the need to make local simplifying modeling choices. The information entropy metric is also used to compute source-to-sink information costs and is related to knockout analyses. The hybrid Petri net approach shows the most important species and where it is easiest to disrupt or otherwise affect the network. As exemplar, the enhanced methodology is applied to a model of the initial subnetwork in the EGFR network.</p>","PeriodicalId":15526,"journal":{"name":"Journal of Computational Biology","volume":" ","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2025-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Biology","FirstCategoryId":"99","ListUrlMain":"https://doi.org/10.1089/cmb.2024.0849","RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"BIOCHEMICAL RESEARCH METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Improved computational methods to analyze the mathematical structure and function of biochemical networks are needed when the biomolecular connectivity is known but when a complete set of the equilibrium and rate constants may not be available. We use Petri nets, which are equivalently bipartite digraphs, to analyze the rule-based flow of information through the network. We present several computational improvements to Petri net modeling as an aid to improve this approach, previously limited by the combinatorics of network size and complexity. The generation of Petri nets using equations for three elemental stencils (molecular reaction, synthesis complex formation, and decomposition complex formation) has been automated. A set of finite probability measures is defined in terms of a partition information entropy, where the complete listing of unique minimal cycles (UMCs) of the Petri net provides the natural partitioning. This enables the ranking of the UMC listing that covers all possible information flows in the reaction network; the information entropy measure enables the identification of which UMCs are more significant than others. In terms of the information entropy, forward cycles are less surprising and carry less information entropy, whereas backward cycles carry more information entropy and serve as regulators by providing feedback to control the network. As the systems analyzed increase in size and complexity, the automatic rank ordering of the UMCs provides a mechanism to highlight the globally most important information without the need to make local simplifying modeling choices. The information entropy metric is also used to compute source-to-sink information costs and is related to knockout analyses. The hybrid Petri net approach shows the most important species and where it is easiest to disrupt or otherwise affect the network. As exemplar, the enhanced methodology is applied to a model of the initial subnetwork in the EGFR network.

利用分区信息熵计算生化信号网络Petri网模型中临界子反应的排序。
当生物分子连通性已知,但平衡常数和速率常数不完整时,需要改进的计算方法来分析生物化学网络的数学结构和功能。我们使用Petri网(相当于二部有向图)来分析网络中基于规则的信息流。我们提出了Petri网建模的几个计算改进,作为改进这种方法的辅助,以前受网络大小和复杂性的组合学的限制。使用三个元素模板(分子反应、合成络合物形成和分解络合物形成)的方程生成Petri网已经自动化。根据分区信息熵定义了一组有限概率度量,其中Petri网的唯一最小循环(UMCs)的完整列表提供了自然分区。这使得UMC列表的排名能够涵盖反应网络中所有可能的信息流;信息熵度量能够识别哪些umc比其他umc更重要。在信息熵方面,正向循环的意外性较小,携带的信息熵较少,而反向循环携带的信息熵较多,并通过提供反馈来控制网络,起到调节器的作用。随着所分析的系统的大小和复杂性的增加,umc的自动排序提供了一种机制来突出显示全局最重要的信息,而不需要进行局部简化建模选择。信息熵度量也用于计算从源到汇的信息成本,并与淘汰分析相关。混合Petri网方法显示了最重要的物种和最容易破坏或以其他方式影响网络的地方。作为示例,将改进的方法应用于EGFR网络中初始子网络的模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Computational Biology
Journal of Computational Biology 生物-计算机:跨学科应用
CiteScore
3.60
自引率
5.90%
发文量
113
审稿时长
6-12 weeks
期刊介绍: Journal of Computational Biology is the leading peer-reviewed journal in computational biology and bioinformatics, publishing in-depth statistical, mathematical, and computational analysis of methods, as well as their practical impact. Available only online, this is an essential journal for scientists and students who want to keep abreast of developments in bioinformatics. Journal of Computational Biology coverage includes: -Genomics -Mathematical modeling and simulation -Distributed and parallel biological computing -Designing biological databases -Pattern matching and pattern detection -Linking disparate databases and data -New tools for computational biology -Relational and object-oriented database technology for bioinformatics -Biological expert system design and use -Reasoning by analogy, hypothesis formation, and testing by machine -Management of biological databases
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信