Lattice structures that parameterize regulatory network dynamics

IF 16.4 1区 化学 Q1 CHEMISTRY, MULTIDISCIPLINARY
Tomáš Gedeon
{"title":"Lattice structures that parameterize regulatory network dynamics","authors":"Tomáš Gedeon","doi":"10.1016/j.mbs.2024.109225","DOIUrl":null,"url":null,"abstract":"<div><p>We consider two types of models of regulatory network dynamics: Boolean maps and systems of switching ordinary differential equations. Our goal is to construct all models in each category that are compatible with the directed signed graph that describe the network interactions. This leads to consideration of lattice of monotone Boolean functions (MBF), poset of non-degenerate MBFs, and a lattice of chains in these sets. We describe explicit inductive construction of these posets where the induction is on the number of inputs in MBF.</p><p>Our results allow enumeration of potential dynamic behavior of the network for both model types, subject to practical limitation imposed by the size of the lattice of MBFs described by the Dedekind number.</p></div>","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2024-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"99","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0025556424000853","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

We consider two types of models of regulatory network dynamics: Boolean maps and systems of switching ordinary differential equations. Our goal is to construct all models in each category that are compatible with the directed signed graph that describe the network interactions. This leads to consideration of lattice of monotone Boolean functions (MBF), poset of non-degenerate MBFs, and a lattice of chains in these sets. We describe explicit inductive construction of these posets where the induction is on the number of inputs in MBF.

Our results allow enumeration of potential dynamic behavior of the network for both model types, subject to practical limitation imposed by the size of the lattice of MBFs described by the Dedekind number.

调控网络动态参数化的晶格结构。
我们考虑了两类调控网络动力学模型:布尔图和开关常微分方程系统。我们的目标是构建每一类模型中与描述网络互动的有向符号图兼容的所有模型。这就需要考虑单调布尔函数(MBF)晶格、非退化 MBF 正集以及这些集合中的链晶格。我们描述了这些集合的显式归纳构造,其中的归纳是基于 MBF 的输入数。我们的结果允许对这两种模型类型的网络潜在动态行为进行枚举,但受到戴德金数所描述的 MBF 网格大小的实际限制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Accounts of Chemical Research
Accounts of Chemical Research 化学-化学综合
CiteScore
31.40
自引率
1.10%
发文量
312
审稿时长
2 months
期刊介绍: Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
×
引用
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学术官方微信