.png){kind=icon}
返回
A SAT-Based Algorithm for Finding Attractors in Synchronous Boolean Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TCBB.2010.20.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses the problem of finding attractors in synchronous Boolean networks. The existing Boolean decision diagram-based algorithms have limited capacity due to the excessive memory requirements of decision diagrams. The simulation-based algorithms can be applied to larger networks, however, they are incomplete. We present an algorithm, which uses a SAT-based bounded model checking to find all attractors in a Boolean network. The efficiency of the presented algorithm is evaluated by analyzing seven networks models of real biological processes, as well as 150,000 randomly generated Boolean networks of sizes between 100 and 7,000. The results show that our approach has a potential to handle an order of magnitude larger models than currently possible.
Keyword:
Bounded model checking
SAT
Boolean network
attractor
gene regulatory network
期刊
I
IF:
3.4
论文数:
3.3K
被引数:
6.4K
机构
引用论文
STRUCTURAL ASPECTS OF IRON COORDINATION COMPOUNDS: I. MONOMERIC DERIVATIVES铁配位化合物的结构方面: I.单体衍生物
PREAI
分享收藏分享收藏分享收藏Ubiquitous somatic mutations in simple repeated sequences reveal a new mechanism for colonic carcinogenesis.png)
Nature
NatureIF0
PREAI
分享收藏
查看更多内容