Algorithms and complexity analyses for control of singleton attractors in Boolean networks.
Algorithms and complexity analyses for control of singleton attractors in Boolean networks.
复制标题
DOI：
10.1155/2008/521407
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
Ching WK
中科院分区：
文献类型：
--
作者：
Hayashida M;Tamura T;Akutsu T;Zhang SQ;Ching WK
布尔网络是遗传网络的一种数学模型。我们提出了几种控制BN中单态吸引子的算法。我们从理论上估计了所提出算法的平均情况时间复杂度，并通过计算机实验对其进行了验证。结果表明基因排序的重要性。特别是在各种算法中，设置内部节点超前比设置外部节点超前的计算时间更短。我们还提出了一种启发式算法，它不是寻找最优解，而是寻找计算时间比精确算法短的解。
A Boolean network (BN) is a mathematical model of genetic networks. We propose several algorithms for control of singleton attractors in BN. We theoretically estimate the average-case time complexities of the proposed algorithms, and confirm them by computer experiments. The results suggest the importance of gene ordering. Especially, setting internal nodes ahead yields shorter computational time than setting external nodes ahead in various types of algorithms. We also present a heuristic algorithm which does not look for the optimal solution but for the solution whose computational time is shorter than that of the exact algorithms.