Algorithms for Inference, Analysis and Control of Boolean Networks
- 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
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.
Unable to display preview. Download preview PDF.