|
Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >
Design of Fixed Points in Boolean Networks Using Feedback Vertex Sets and Model Reduction
This item is licensed under:Creative Commons Attribution 4.0 International
| Title: | Design of Fixed Points in Boolean Networks Using Feedback Vertex Sets and Model Reduction |
| Authors: | Kobayashi, Koichi Browse this author →KAKEN DB |
| Issue Date: | 4-Mar-2019 |
| Publisher: | Wiley-Hindawi |
| Journal Title: | Complexity |
| Volume: | 2019 |
| Start Page: | 9261793 |
| Publisher DOI: | 10.1155/2019/9261793 |
| Abstract: | Fixed points in Boolean networks (BNs) represent cell types or states of cells and are important to decide characteristics of cells. As the control problem on fixed points, it is important to consider the problem of changing fixed points by using external stimuli (i.e., control inputs). In this paper, we propose two methods for designing fixed points. First, a design method using model reduction is proposed. Using the reduced model, the problem of placing fixed points can be rewritten as an integer linear programming problem. Next, we consider the design problem using only the graph structure of a given BN and derive some results. In both methods, a feedback vertex set of a directed graph plays an important role. Finally, a biological example is presented. |
| Rights: | http://creativecommons.org/licenses/by/4.0/ |
| Type: | article |
| URI: | http://hdl.handle.net/2115/73831 |
| Appears in Collections: | 情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)
|
Submitter: 小林 孝一
|
