A Modified Orthogonal Matching Pursuit for Construction of Sparse Probabilistic Boolean Networks
Numerical Analysis
2021-10-20 v2 Numerical Analysis
Abstract
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.
Keywords
Cite
@article{arxiv.2008.09767,
title = {A Modified Orthogonal Matching Pursuit for Construction of Sparse Probabilistic Boolean Networks},
author = {Guiyun Xiao and Zheng-Jian Bai and Wai-Ki Ching},
journal= {arXiv preprint arXiv:2008.09767},
year = {2021}
}
Comments
18 pages, 14 figures