A Modified Orthogonal Matching Pursuit for Construction of Sparse Probabilistic Boolean Networks
share
The probabilistic Boolean network plays 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 exactly or in the least square sense. We also report some numerical results to illustrate the effectiveness of the proposed algorithm.
READ FULL TEXT