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

Author

Kobayashi, Koichi

Source

Complexity

Issue

Vol. 2019, Issue 2019 (31 Dec. 2019), pp.1-9, 9 p.

Publisher

Hindawi Publishing Corporation

Publication Date

2019-03-04

Country of Publication

Egypt

No. of Pages

9

Main Subjects

Philosophy

Abstract EN

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.

American Psychological Association (APA)

Kobayashi, Koichi. 2019. Design of Fixed Points in Boolean Networks Using Feedback Vertex Sets and Model Reduction. Complexity،Vol. 2019, no. 2019, pp.1-9.
https://search.emarefa.net/detail/BIM-1133181

Modern Language Association (MLA)

Kobayashi, Koichi. Design of Fixed Points in Boolean Networks Using Feedback Vertex Sets and Model Reduction. Complexity No. 2019 (2019), pp.1-9.
https://search.emarefa.net/detail/BIM-1133181

American Medical Association (AMA)

Kobayashi, Koichi. Design of Fixed Points in Boolean Networks Using Feedback Vertex Sets and Model Reduction. Complexity. 2019. Vol. 2019, no. 2019, pp.1-9.
https://search.emarefa.net/detail/BIM-1133181

Data Type

Journal Articles

Language

English

Notes

Includes bibliographical references

Record ID

BIM-1133181