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

Koichi Kobayashi

Complexity, 2019, vol. 2019, 1-9

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.

Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2019/9261793.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2019/9261793.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:9261793

DOI: 10.1155/2019/9261793

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().