Integer Programming and Dynamic Programming-based Methods of Optimizing Control Policy in Probabilistic Boolean Networks with Hard Constraints
スポンサーリンク
概要
- 論文の詳細を見る
Control problems of Boolean Networks (BNs) and Probabilistic Boolean Networks (PBNs) are studied in this paper. BN CONTROL is formalized to derive the network to the desired state within a few time steps by external control. PBN CONTROL is formalized to nd a control sequence such that the network will terminate in the desired state with a maximum probability. Furthermore, we propose to minimize the maximum cost of the terminal state to which the network will enter. For solving the above problems, integer linear programming and dynamic programming-based methods in conjunction with hard constraints are developed. A hardness result suggesting that PBN CONTROL is harder than BN CONTROL is also presented.
- 一般社団法人情報処理学会の論文
- 2011-03-03
著者
-
Tatsuya Akutsu
Bioinformatics Center, Institute for Chemical Research, Kyoto University
-
Ching Wai-ki
Department Of Mathematics The University Of Hong Kong
-
Takeyuki Tamura
Bioinformatics Center Institute For Chemical Research Kyoto Univerty
-
Tatsuya Akutsu
Bioinformatics Center Institute For Chemical Research Kyoto University
-
Xi Chen
Amac Laboratory Department Of Mathematics The University Of Hong Kong
-
Tatsuya Akutsu
Bioinformatics Center Institute For Chemical Research Kyoto Univerty
-
Takeyuki Tamura
Bioinformatics Center Institute For Chemical Research Kyoto University
関連論文
- Prediction of Protein Folding Rates from Structural Topology and Complex Network Properties
- Prediction of Protein Folding Rates from Structural Topology and Complex Network Properties
- RNA-RNA Interaction Prediction Using Integer Programming with Threshold Cut
- A Quadsection Algorithm for Grammar-Based Image Compression
- Analyses and Algorithms for Predecessor and Control Problems for Boolean Networks of Bounded Indegree
- Conditional Random Field Approach to Prediction of Protein-protein Interactions Using Domain Information
- Integer Programming and Dynamic Programming-based Methods of Optimizing Control Policy in Probabilistic Boolean Networks with Hard Constraints
- An Improved Clique-Based Method for Computing Edit Distance between Rooted Unordered Trees
- Prediction of protein residue contacts using discriminative random field
- Prediction of protein residue contacts using discriminative random field
- Efficient Computation of Impact Degrees for Multiple Reactions in Metabolic Networks with Cycles
- Prediction of RNA Secondary Structures with Binding Sites Using Dynamic Programming Algorithm
- Message from the Editor-in-Chief
- Message from the Editor-in-Chief
- Message from the Editor-in-Chief
- Protein complex prediction via improved verification methods using constrained domain-domain matching
- Analyses and Algorithms for Predecessor and Control Problems for Boolean Networks of Bounded Indegree
- Predicting Protein-RNA Residue-base Contacts Using Two-dimensional Conditional Random Field
- Finding Conserved Regions in Protein Structures Using Support Vector Machines and Structure Alignment
- Inferring Strengths of Protein-Protein Interactions Using Support Vector Regression
- Evaluating Effectiveness of Accessibility to Infer RNA-RNA Interactions
- Survival Analysis by Penalized Regression and Matrix Factorization
- A Dominating Set Approach to Structural Controllability of Unidirectional Bipartite Networks
- Prediction of Heterodimeric Protein Complexes from Weighted Protein-Protein Interaction Networks Using Novel Features and Kernel Functions
- Prediction of Heterodimeric Protein Complexes from Weighted Protein-Protein Interaction Networks Using Novel Features and Kernel Functions
- Breadth-first Search Approach to Enumeration of Tree-like Chemical Compounds
- Breadth-first Search Approach to Enumeration of Tree-like Chemical Compounds
- On the Complexity of Inference and Completion of Boolean Networks from Given Singleton Attractors
- Algorithms for Finding a Largest Common Subtree of Bounded Degree
- Parallelization of Enumerating Tree-like Chemical Compounds by Breadth-first Search Order
- Prediction of Heterotrimeric Protein Complexes by Two-phase Learning Using Neighboring Kernels
- Prediction of Heterotrimeric Protein Complexes by Two-phase Learning Using Neighboring Kernels
- Grammar-based Compression for Multiple Trees Using Integer Programming
- Grammar-based Compression for Multiple Trees Using Integer Programming