IEICE TRANSACTIONS on Information
Integer Programming-Based Approach to Attractor Detection and Control of Boolean Networks
Summary :
The Boolean network (BN) can be used to create discrete mathematical models of gene regulatory networks. In this paper, we consider three problems on BNs that are known to be NP-hard: detection of a singleton attractor, finding a control strategy that shifts a BN from a given initial state to the desired state, and control of attractors. We propose integer programming-based methods which solve these problems in a unified manner. Then, we present results of computational experiments which suggest that the proposed methods are useful for solving moderate size instances of these problems. We also show that control of attractors is
- Publication
- IEICE TRANSACTIONS on Information Vol.E95-D No.12 pp.2960-2970
- Publication Date
- 2012/12/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E95.D.2960
- Type of Manuscript
- PAPER
- Category
- Fundamentals of Information Systems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Tatsuya AKUTSU, Yang ZHAO, Morihiro HAYASHIDA, Takeyuki TAMURA, "Integer Programming-Based Approach to Attractor Detection and Control of Boolean Networks" in IEICE TRANSACTIONS on Information,
vol. E95-D, no. 12, pp. 2960-2970, December 2012, doi: 10.1587/transinf.E95.D.2960.
Abstract: The Boolean network (BN) can be used to create discrete mathematical models of gene regulatory networks. In this paper, we consider three problems on BNs that are known to be NP-hard: detection of a singleton attractor, finding a control strategy that shifts a BN from a given initial state to the desired state, and control of attractors. We propose integer programming-based methods which solve these problems in a unified manner. Then, we present results of computational experiments which suggest that the proposed methods are useful for solving moderate size instances of these problems. We also show that control of attractors is
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E95.D.2960/_p
Copy
@ARTICLE{e95-d_12_2960,
author={Tatsuya AKUTSU, Yang ZHAO, Morihiro HAYASHIDA, Takeyuki TAMURA, },
journal={IEICE TRANSACTIONS on Information},
title={Integer Programming-Based Approach to Attractor Detection and Control of Boolean Networks},
year={2012},
volume={E95-D},
number={12},
pages={2960-2970},
abstract={The Boolean network (BN) can be used to create discrete mathematical models of gene regulatory networks. In this paper, we consider three problems on BNs that are known to be NP-hard: detection of a singleton attractor, finding a control strategy that shifts a BN from a given initial state to the desired state, and control of attractors. We propose integer programming-based methods which solve these problems in a unified manner. Then, we present results of computational experiments which suggest that the proposed methods are useful for solving moderate size instances of these problems. We also show that control of attractors is
keywords={},
doi={10.1587/transinf.E95.D.2960},
ISSN={1745-1361},
month={December},}
Copy
TY - JOUR
TI - Integer Programming-Based Approach to Attractor Detection and Control of Boolean Networks
T2 - IEICE TRANSACTIONS on Information
SP - 2960
EP - 2970
AU - Tatsuya AKUTSU
AU - Yang ZHAO
AU - Morihiro HAYASHIDA
AU - Takeyuki TAMURA
PY - 2012
DO - 10.1587/transinf.E95.D.2960
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E95-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2012
AB - The Boolean network (BN) can be used to create discrete mathematical models of gene regulatory networks. In this paper, we consider three problems on BNs that are known to be NP-hard: detection of a singleton attractor, finding a control strategy that shifts a BN from a given initial state to the desired state, and control of attractors. We propose integer programming-based methods which solve these problems in a unified manner. Then, we present results of computational experiments which suggest that the proposed methods are useful for solving moderate size instances of these problems. We also show that control of attractors is
ER -
English
