A modified orthogonal matching pursuit for construction of sparse probabilistic boolean networks

作者：

Highlights：

• The inverse problem of constructing a sparse probabilistic Boolean network from the prescribed transition probability matrix is considered.

• A modified orthogonal matching pursuit is proposed.

• Some necessary conditions and sufficient conditions on the sparse recovery of our method are derived.

摘要

•The inverse problem of constructing a sparse probabilistic Boolean network from the prescribed transition probability matrix is considered.•A modified orthogonal matching pursuit is proposed.•Some necessary conditions and sufficient conditions on the sparse recovery of our method are derived.

论文关键词：Probabilistic boolean network,Inverse problem,Sparse,Modified orthogonal matching pursuit

论文评审过程：Received 28 March 2021, Revised 8 February 2022, Accepted 18 February 2022, Available online 9 March 2022, Version of Record 9 March 2022.

论文官网地址：https://doi.org/10.1016/j.amc.2022.127041