Chapter

Algebraic Biology

Volume 5147 of the series Lecture Notes in Computer Science pp 1-15

Algorithms for Inference, Analysis and Control of Boolean Networks

  • Tatsuya AkutsuAffiliated withBioinformatics Center, Institute for Chemical Research, Kyoto University
  • , Morihiro HayashidaAffiliated withBioinformatics Center, Institute for Chemical Research, Kyoto University
  • , Takeyuki TamuraAffiliated withBioinformatics Center, Institute for Chemical Research, Kyoto University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.