Analysis of gene regulatory networks in Boolean models

布尔网络（BN）是描述细胞基因调控关系的离散数学模型。虽然寻找BN的稳定状态和控制策略的问题是已知的NP-难的，他们往往是可解决的，由于最近的高性能计算vie精确算法和/或整数规划为基础的methods.In这项研究中，精确算法寻找周期2吸引子。此外，基于整数规划的方法被开发用于寻找单点吸引子、控制BN和控制吸引子的问题。

The Boolean network (BN) is a discrete mathematical model for describing regulatory relationship of genes in cells. Although problems for finding stable states of BNs and control strategies are known to be NP-hard, they are often solvable for middle size networks due to recent high performance computing vie exact algorithms and/or integer programming-based methods.In this research, exact algorithms for finding attractors of period 2 were developed. Furthermore, integer programming-based methods were developed for problems for finding singleton attractors, control of BNs, and control of attractors.