Polynomial-time controllability analysis of boolean networks

Authors:
Koichi Kobayashi;Jun-ichi Imura;Kunihiko Hiraishi
Affiliations:
Japan Advanced Institute of Science and Technology, Ishikawa, Japan;Tokyo Institute of Technology, Tokyo, Japan;Japan Advanced Institute of Science and Technology, Ishikawa, Japan
Venue:
ACC'09 Proceedings of the 2009 conference on American Control Conference
Year:
2009

Citing 2
Cited 0

Dynamical analysis of a generic Boolean model for the control of the mammalian cell cycle

Bioinformatics
Boolean dynamics of genetic regulatory networks inferred from microarray time series data

Bioinformatics

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper discusses the controllability problem of Boolean networks with inputs (control nodes) and outputs (controlled nodes). An algorithm for testing controllability is in general NP-hard, and the existing polynomial-time algorithm is limited to a class of tree-structure networks. In this paper, based on a sufficient condition for controllability, a polynomial-time algorithm is proposed. The proposed algorithm is applicable to a wider class of large-scale Boolean networks compared with the existing algorithm. The key idea in our approach is to use an adjacency matrix of a directed graph induced by a Boolean network, and Boolean operations are not focused. The effectiveness of the proposed approach is shown by an example of a biological network.