.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Context-sensitive probabilistic Boolean networks
Optimal control
Integer programming
Biological networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
Organization
Cited Papers
ShareSaveShareSave
ShareSaveOpinon - Cancer as a robust system: implications for anticancer therapy.png)
NATURE REVIEWS CANCER
NATURE REVIEWS CANCERIF66.8
PREAI
ShareSaveShareSaveShareSaveShareSave
View more