Abstract

Boolean networks have been successfully used in modeling biological systems. The fixed points, cycles and transient states that lead to them play an essential role to describe the structure of Boolean networks. In this paper we propose an algorithm to get all the fixed points and cycles of Boolean network by using the results of semi-tensor product and permutation. At last, an example is given to illustrate the efficiency of the obtained results.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.