.png){kind=icon}
返回
An integer programming approach to optimal control problems in context-sensitive probabilistic Boolean networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2011.01.035.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A Boolean network is one of the models of biological networks such as gene regulatory networks, and has been extensively studied. In particular, a probabilistic Boolean network (PBN) is well known as an extension of Boolean networks, but in the existing methods to solve the optimal control problem of PBNs, it is necessary to compute the state transition diagram with 2(n) nodes for a given PBN with n states. To avoid this computation, an integer programming-based approach is proposed for a context-sensitive PBN (CS-PBN), which is a general form of PBNs. In the proposed method, a CS-PBN is transformed into a linear system with binary variables, and the optimal control problem is reduced to an integer linear programming problem. By a numerical example, the effectiveness of the proposed method is shown. Crown Copyright (C) 2011 Published by Elsevier Ltd. All rights reserved.
Keyword:
Context-sensitive probabilistic Boolean networks
Optimal control
Integer programming
Biological networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。