New results on model reconstruction of Boolean networks with application to gene regulatory networks.

This paper is dedicated to solving the model reconstruction problem of Boolean networks (BNs) based on incomplete information. By resorting to semi‐tensor product, the issue of finding logical functions is converted into designing corresponding structure matrices. In line with desired attractors, two circumstances, standard BNs and delayed BNs, are taken into consideration, and several new results are presented. For the model reconstruction of standard BNs, an algebraic condition is put forward and an algorithm is developed for reconstructing unknown logical functions. For the model reconstruction of delayed BNs, an augmented system is deduced, based on which, several criteria and the corresponding algorithm are proposed. Finally, as an application to gene regulatory networks, the results obtained in this paper are used to analyze the WNT5A network and the apoptosis network. [ABSTRACT FROM AUTHOR]