Skip to main content
SpringerLink
Log in

An Effective Approach of Attractor Calculation for Boolean Control Networks

  • Published:
International Journal of Control, Automation and Systems Aims and scope Submit manuscript

Abstract

Boolean networks have rich dynamics properties widely used in modeling and investigating circuit design, artificial intelligence, biological research. Generally, a gene regulation network is not independent. It interacts between external networks and external regulation signals. Therefore, the Boolean network with external control signals, that is, Boolean control network, has become a potential effective tool for studying gene regulatory networks. Attractor calculation is the main research content of Boolean control networks. In this study, an approach of attractor calculation was proposed for Boolean control networks. Examples and simulations also confirmed that the proposed approach is very effective and can get all attractors of large-scale Boolean control networks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. E. Ferrell and E. M. Machleder, “The biochemical basis of an all-or-none cell fate switch in Xenopus oocytes,” Science, vol. 280, no. 5365, pp. 895–898, 1998.

    Article  Google Scholar 

  2. T. S. Gardner, C. R. Gantor, and J. J. Collins, “Construction of a genetic toggle switch in Escherichia coli,” Nature, vol. 403, no. 6767, pp. 339–342, 2000.

    Article  Google Scholar 

  3. Q. B. He and Z. R. Liu, “Investigation of oscillation accumulation triggered genetic switch in gene regulatory networks,” Journal of Theoretical Biology, vol. 353, pp. 61–66, 2014.

    Article  MathSciNet  Google Scholar 

  4. L. Grieco, L. Calzone, T. Bernard-Pierrot, F. Radvanyi, B. Kahn-Perles, and D. Thieffry, “Integrative modelling of the influence of MAPK network on cancer cell fate decision,” PLoS Computational Biology, vol. 9, no. 11, e1003286, 2013.

    Article  Google Scholar 

  5. D. Hanahan and R. A. Weinberg, “The hallmarks of cancer,” Cell, vol. 100, no. 1, pp. 57–70, 2000.

    Article  Google Scholar 

  6. J. Lu, H. Zeng, Z. Liang, L. Chen, L. Zhang, H. Zhang, H. Liu, H. Jiang, B. Shen, M. Huang, M. Geng, S. Spiegel, and C. Luo, “Network modelling reveals the mechanism underlying colitis-associated colon cancer and identifies novel combinatorial anti-cancer targets,” Scientific Reports (SCI REP-UK), vol. 5, no. 1, 14739, 2005.

    Article  Google Scholar 

  7. S. A. Kauffman, “Metabolic stability and epigenesist in randomly constructed nets,” Journal of Theoretical Biology, vol. 22, no. 3, pp. 437–467, 1969.

    Article  MathSciNet  Google Scholar 

  8. S. A. Kauffman, The Origins of Order: Self-organization and Selection in Evolution, Oxford University Press, New York, 1993.

    Book  Google Scholar 

  9. G. Smith, F. A. Carey, J. Beattie, M. J. Wilkie, T. J. Light-foot, J. Coxhead, R. C. Garner, R. J. Steele, and C. R. Wolf, “Mutations in APC, Kirsten-ras, and p53-alternative genetic pathways to colorectal cancer,” Proc. of the National Academy of Sciences, vol. 99, no. 14, pp. 9433–9438, 2002.

    Article  Google Scholar 

  10. H. F. Fumië and M. L. Martins, “Boolean network model for cancer pathways: Predicting carcinogenesis and targeted therapy outcomes,” PLoS One, vol. 8, no. 7, e69008, 2003.

    Article  Google Scholar 

  11. D. Z. Cheng and H. S. Qi, “A linear representation of dynamics of Boolean networks,” IEEE Transactions on Automatic Control, vol. 55, no. 10, pp. 2251–2258, 2010.

    Article  MathSciNet  Google Scholar 

  12. D. Z. Cheng, H. S. Qi, and Z. Q. Li, “Analysis and control of Boolean networks: A semi-tensor product approach,” Acta Automatica Sinica, vol. 37, no. 5, pp. 529–540, 2011.

    MathSciNet  Google Scholar 

  13. T. Akutsu, S. Kuhara, O. Maruyama, S. Miyano, “A system for identifying genetic networks from gene Expression patterns produced by gene disruptions and overexpressions,” Genomics & Informatics, no. 9, pp. 151–60, 1998.

  14. T. Akutsu, S. Kosub, A. A. Melkman, and T. Tamura, “Finding a periodic attractor of a Boolean network,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 9, no. 5, pp. 1410–1421, 2012.

    Article  Google Scholar 

  15. J. Pan, J. Feng, M. Meng, and J. Zhao, “Design of large-scale Boolean networks based on prescribed attractors,” International Journal of Control, Automation, and Systems, vol. 16, no. 3, pp. 1120–1128, 2018.

    Article  Google Scholar 

  16. Q. Sun, W. Hou, H. Li, and J. Wang, “Finite-time set stabilization of impulsive probabilistic Boolean control networks via time-variant feedback control,” International Journal of Control, Automation, and Systems, vol. 20, pp. 3592–3605, 2022.

    Article  Google Scholar 

  17. K. Kobayashi and K. Hiraishi, “An integer programming approach to optimal control problems in context-sensitive probabilistic Boolean networks,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. 95, no. 9, pp. 1512–1517, 2012.

    Article  Google Scholar 

  18. K. Kobayashi and K. Hiraishi, “An integer programming approach to optimal control problems in context-sensitive probabilistic Boolean networks,” Automatica, no. 47, pp. 1260–1264, 2011.

  19. Y. S. Qiu, T. Tamura, W. K. Ching, and T. Akutsu, “On control of singleton attractors in multiple Boolean networks: integer programming-based method,” BMC Systems Biology, no. 8, pp. 1–10, 2014.

  20. T. Akutsu, Y. Zhao, M. Hayashida, and T. Tamura, “Integer programming-based approach to attractor detection and control of Boolean networks,” IEICE Transactions on Information and Systems, vol. E95-D, no. 12, pp. 2960–2970, 2012.

    Article  Google Scholar 

  21. D. J. Irons, “Improving the efficiency of attractor cycle identification in Boolean networks,” Physica D, vol. 217, no. 1, pp. 7–21, 2006.

    Article  MathSciNet  Google Scholar 

  22. E. Dubrova and M. Teslenko, “A SAT-based algorithm for finding attractors in synchronous Boolean networks,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 8, pp. 1393–1399, 2011.

    Article  Google Scholar 

  23. Q. B. He, Z. L. Xia, and B. Lin, “P_UNSAT approach of attractor calculation for Boolean gene regulatory networks,” Journal of Theoretical Biology, vol. 447, pp. 171–177, 2018.

    Article  MathSciNet  Google Scholar 

  24. Q. B. He, Z. L. Xia, and B. Lin, “An efficient approach of attractor calculation for large-scale Boolean gene regulatory networks,” Journal of Theoretical Biology, no. 408, pp. 137–144, 2016.

  25. A. Biere, M. Heule, H. Van Maaren, and T. Walsh, “Handbook of Satisfiability,” IOS Press, ISBN:1586039296, 2009.

  26. M. Davis and H. Putnam, “A computing procedure for quantification theory,” Journal of the ACM, no. 7, pp. 201–215, 1965.

  27. M. Davis, G. Logemann, Dand. Loveland, “A machine program for theorem-proving,” Communications of the ACM no. 5, pp. 394–397, 1962.

  28. O. Riós, S. Frias, A. Rodriǵuez, S. Kofman, H. Merchant, L. Torres, and L. Mendoza, “A boolean network model of human gonadal sex determination,” Theoretical Biology and Medical Modelling, vol. 12, no. 1, pp. 26–26, 2015.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electronics and Information Engineering, Taizhou University, Zhejiang, 318000, China

    Qinbin He

  2. College of Geography and Environmental Sciences, Zhejiang Normal University, Zhejiang, 321004, China

    Siyue He

Authors
  1. Qinbin He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Siyue He
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qinbin He.

Ethics declarations

The authors declare that there is no competing financial interest or personal relationship that could have appeared to influence the work reported in this paper.

Additional information

Publisher’s Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Qinbin He received his Ph.D. degree in informatics and systems biology from Shanghai University in 2012. Currently, he is a Full Professor with the School of Electronics and Information Engineering, Taizhou University, Zhejiang, China. His main research interests include systems biology, dynamical systems theory, neural networks, and computer software designing.

Siyue He is pursuing a B.S. degree from the College of Geography and Environmental Sciences. Her research interests include systems biology, and environmental sciences.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

He, Q., He, S. An Effective Approach of Attractor Calculation for Boolean Control Networks. Int. J. Control Autom. Syst. (2024). https://doi.org/10.1007/s12555-022-1241-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s12555-022-1241-y

Keywords

Search

Navigation