An Algorithm to Find Cycles of Biochemical Systems

DOI

10.2991/icibet.2013.4How to use a DOI?

Abstract

Genetic regulatory systems, self-organized 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.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Desheng Zheng
AU  - Guowu Yang
AU  - Xiaoyu Li
AU  - Zhicai Wang
PY  - 2013/03
DA  - 2013/03
TI  - An Algorithm to Find Cycles of Biochemical Systems
BT  - Proceedings of the 2013 International Conference on Information, Business and Education Technology (ICIBET 2013)
PB  - Atlantis Press
SP  - 14
EP  - 18
SN  - 1951-6851
UR  - https://doi.org/10.2991/icibet.2013.4
DO  - 10.2991/icibet.2013.4
ID  - Zheng2013/03
ER  -