Algorithms for Inference, Analysis and Control of Boolean Networks

Boolean networks (BNs) are known as a mathematical model of genetic networks. In this paper, we overview algorithmic aspects of inference, analysis and control of BNs while focusing on the authors’ works. For inference of BN, we review results on the sample complexity required to uniquely identify a BN. For analysis of BN, we review efficient algorithms for identifying singleton attractors. For control of BN, we review NP-hardness results and dynamic programming algorithms for general and special cases.

• Type: Conference
• Year: 2008
• Where: AB
• Authors: Tatsuya Akutsu, Morihiro Hayashida, Takeyuki Tamura
• Keywords: AB 2008, Algorithmic Aspects, Computational Biology, Dynamic Programming Algorithms, Genetic Networks