首页|A modified orthogonal matching pursuit for construction of sparse probabilistic boolean networks
A modified orthogonal matching pursuit for construction of sparse probabilistic boolean networks
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
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. (C) 2022 Elsevier Inc. All rights reserved.
NSTL
Elsevier
