  Probabilistic Boolean Networks play a remarkable role in the modelling and
control of gene regulatory networks. In this paper, we consider the inverse
problem of constructing a sparse probabilistic Boolean network from the
prescribed transition probability matrix. We propose a modified orthogonal
matching pursuit for solving the inverse problem. We provide some conditions
under which the proposed algorithm can recover a sparse probabilistic Boolean
network. We also report some numerical results to illustrate the effectiveness
of the proposed algorithm.
