An Algorithm to Find Cycles of Biochemical Systems
Genetic regulatory systems,selforganized systems and other living systems can be modeled as synchronous Boolean networks with stable states which are also called cycles.This paper devises two algorithms based on BDD to compute all the cycles in synchronous Boolean networks and enumerate all states in those cycles.Empirical experiments with biochemical systems demonstrate the feasibility and efficiency of our algorithms.It also shows that the two algorithms are conceptually so simple and efficient that they can be extensible to other realistic biochemical systems.
genetic regulatory system synchronous Boolean network BDD biochemical system
Desheng Zheng Guowu Yang Xiaoyu Li Zhicai Wang
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China
国际会议
北京
英文
14-18
2013-03-14(万方平台首次上网日期,不代表论文的发表时间)