quotation:[Copy]
[Copy]
【Print page】 【Online reading】【Download 【PDF Full text】 View/Add CommentDownload reader Close

←Previous page|Page Next →

Back Issue    Advanced search

This Paper:Browse 51   Download 18 本文二维码信息
码上扫一扫!
Robust network structures for conserving total activity in Boolean networks
Shun-ichiAZUMA
0
(Graduate School of Engineering, Nagoya University, Furo-cho, Chikusa-ku, Nagoya, 464-8603, Japan)
摘要:
One of the typical properties of biological systems is the law of conservation of mass, that is, the property that the mass must remain constant over time in a closed chemical reaction system. However, it is known that Boolean networks, which are a promising model of biological networks, do not always represent the conservation law. This paper thus addresses a kind of conservation law as a generic property of Boolean networks. In particular, we consider the problem of finding network structures on which, for any Boolean operation on nodes, the number of active nodes, i.e., nodes whose state is one, is constant over time. As a solution to the problem, we focus on the strongly-connected network structures and present a necessary and sufficient condition.
关键词:  Boolean network, robust network structure, structural analysis, conservation law
DOI:https://doi.org/10.1007/s11768-020-9202-6
基金项目:This work was supported by Grant-in-Aid for Scientific Research (B) #17H03280 from the Ministry~of~Education, Culture, Sports, Science and Technology of Japan.
Robust network structures for conserving total activity in Boolean networks
Shun-ichi AZUMA
(Graduate School of Engineering, Nagoya University, Furo-cho, Chikusa-ku, Nagoya, 464-8603, Japan)
Abstract:
One of the typical properties of biological systems is the law of conservation of mass, that is, the property that the mass must remain constant over time in a closed chemical reaction system. However, it is known that Boolean networks, which are a promising model of biological networks, do not always represent the conservation law. This paper thus addresses a kind of conservation law as a generic property of Boolean networks. In particular, we consider the problem of finding network structures on which, for any Boolean operation on nodes, the number of active nodes, i.e., nodes whose state is one, is constant over time. As a solution to the problem, we focus on the strongly-connected network structures and present a necessary and sufficient condition.
Key words:  Boolean network, robust network structure, structural analysis, conservation law