Analysis of gene regulatory networks in Boolean models

布尔网络（Boolean network， BN）是描述细胞中基因调控关系的离散数学模型。尽管已知寻找bn稳定状态和控制策略的问题是np困难的，但由于最近的高性能计算算法和/或基于整数规划的方法，它们通常可以解决中等规模的网络。在本研究中，提出了寻找周期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.