A semi-tensor product approach for probabilistic boolean networks

Abstract

Modeling genetic regulatory networks is an important issue in systems biology. Various models and mathematical formalisms have been proposed in the literature to solve the capture problem. The main purpose in this paper is to show that the transition matrix generated under semi-tensor product approach (Here we call it the probability structure matrix for simplicity) and the traditional approach (Transition probability matrix) are similar to each other. And we shall discuss three important problems in Probabilistic Boolean Networks (PBNs): the dynamic of a PBN, the steady-state probability distribution and the inverse problem. Numerical examples are given to show the validity of our theory. We shall give a brief introduction to semi-tensor and its application. After that we shall focus on the main results: to show the similarity of these two matrices. Since the semi-tensor approach gives a new way for interpreting a BN and therefore a PBN, we expect that advanced algorithms can be developed if one can describe the PBN through semi-tensor product approach.