Algorithms for Inference, Analysis and Control of Boolean Networks

  • Tatsuya Akutsu
  • Morihiro Hayashida
  • Takeyuki Tamura
Conference paper

DOI: 10.1007/978-3-540-85101-1_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5147)
Cite this paper as:
Akutsu T., Hayashida M., Tamura T. (2008) Algorithms for Inference, Analysis and Control of Boolean Networks. In: Horimoto K., Regensburger G., Rosenkranz M., Yoshida H. (eds) Algebraic Biology. AB 2008. Lecture Notes in Computer Science, vol 5147. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Tatsuya Akutsu
    • 1
  • Morihiro Hayashida
    • 1
  • Takeyuki Tamura
    • 1
  1. 1.Bioinformatics Center, Institute for Chemical ResearchKyoto UniversityKyotoJapan

Personalised recommendations