Robust minimal strong reconstructibility problem of Boolean control networks

Abstract

In this paper, the problem of robust minimal strong reconstructibility (RMSR) of Boolean control networks (BCNs) with multi-bit perturbations is studied by using graph theory. The problem takes the premise that BCNs are strongly reconstructible before function perturbation. We analyze the effect of the multi-bit perturbation on the strong reconstructibility of BCNs and present two valid criteria for the robust strong reconstructibility of BCNs. Then, to avoid the effect of function perturbation on the strong reconstructibility of BCNs, the problem of adding a minimal sensor set is considered, thereby making the BCNs robust minimal strong reconstructible after function perturbation. Finally, the results are applied to a biological example.