Design of Fixed Points in Boolean Networks Using Feedback Vertex Sets and Model Reduction

• Kobayashi, Koichi

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.

Journal

• Complexity

  Complexity 2019 9261793-, 2019-03-04

  Wiley-Hindawi

Keywords

• Multidisciplinary
• General Computer Science

Details

• CRID: 1050845763990828288
• NII Article ID: 120006626586
• NII Book ID: AA11038146
• DOI: 10.1155/2019/9261793
• ISSN: 10990526
• ISSN: 10762787
• HANDLE: 2115/73831
• Web Site: http://downloads.hindawi.com/journals/complexity/2019/9261793.pdf
• Web Site: http://downloads.hindawi.com/journals/complexity/2019/9261793.xml
• Text Lang: en
• Article Type: journal article
• Data Source:
  • IRDB
  • Crossref
  • CiNii Articles
  • KAKEN