Construction Method of Probabilistic Boolean Networks Based on Imperfect Information

Umiji, Katsuaki; Kobayashi, Koichi; Yamashita, Yuh

Construction Method of Probabilistic Boolean Networks Based on Imperfect Information

Umiji, Katsuaki; Kobayashi, Koichi; Yamashita, Yuh

Algorithms, 2019, 12(12), 268

Permalink : https://hdl.handle.net/2115/76727

このアイテムのアクセス数:544件（2026-08-09 20:40 集計）

閲覧可能ファイル

ファイル	フォーマット	サイズ	閲覧回数	説明
https://doi.org/10.3390/a12120268			29

論文情報

ファイル出力 EndNote Basic出力 Mendeley出力

アクセス権	open access
URI	https://hdl.handle.net/2115/76727
タイトル	Construction Method of Probabilistic Boolean Networks Based on Imperfect Information
著者	Umiji, Katsuaki ; Kobayashi, Koichi ; Yamashita, Yuh
著者名 Umiji, Katsuaki
e-Rad_Researcher 50452115 著者名 Kobayashi, Koichi
e-Rad_Researcher 90210426 著者名 Yamashita, Yuh
言語	英語
キーワード	gene regulatory network
	linear programming
	matrix-based representation
	probabilistic Boolean network
発行日	2019-12
出版者	MDPI
収録物名	Algorithms
巻(号)	12(12)
ページ	268
抄録	A probabilistic Boolean network (PBN) is well known as one of the mathematical models of gene regulatory networks. In a Boolean network, expression of a gene is approximated by a binary value, and its time evolution is expressed by Boolean functions. In a PBN, a Boolean function is probabilistically chosen from candidates of Boolean functions. One of the authors has proposed a method to construct a PBN from imperfect information. However, there is a weakness that the number of candidates of Boolean functions may be redundant. In this paper, this construction method is improved to efficiently utilize given information. To derive Boolean functions and those selection probabilities, the linear programming problem is solved. Here, we introduce the objective function to reduce the number of candidates. The proposed method is demonstrated by a numerical example.
資源タイプ	学術雑誌論文
出版タイプ	Version of Record
権利情報	Creative Commons Attribution 4.0 International
EISSN	1999-4893
関連情報 (isIdenticalTo)	出版社版DOI https://doi.org/10.3390/a12120268