Polynomial-Time Algorithm for Controllability Test of a Class of Boolean Biological Networks
スポンサーリンク
概要
- 論文の詳細を見る
In recent years, Boolean-network-model-based approaches to dynamical analysis of complex biological networks such as gene regulatory networks have been extensively studied. One of the fundamental problems in control theory of such networks is the problem of determining whether a given substance quantity can be arbitrarily controlled by operating the other substance quantities, which we call the controllability problem. This paper proposes a polynomial-time algorithm for solving this problem. Although the algorithm is based on a sufficient condition for controllability, it is easily computable for a wider class of large-scale biological networks compared with the existing approaches. A key to this success in our approach is to give up computing Boolean operations in a rigorous way and to exploit an adjacency matrix of a directed graph induced by a Boolean network. By applying the proposed approach to a neurotransmitter signaling pathway, it is shown that it is effective.
- 2010-07-08
論文 | ランダム
- Denatured human alpha-defensin attenuates the bactericidal activity and the stability against enzymatic digestion
- Age-related differences in localization of beta-defensin-2 in human gingival epithelia
- Toll-like Receptors, NOD1, and NOD2 in Oral Epithelial Cells
- 唾液と高齢者の健康 : 唾液成分の特徴と関連する因子について
- 人間の体内リズムはなぜ起こるのか( 人間の生理的なリズムと光)