Abstract
Biological regulatory network can be modeled through a set of Boolean functions. These set of functions enable graph representation of the network structure, and hence, the dynamics of the network can be seen easily. In this article, the regulations of such network have been explored in terms of interaction graph. With the help of Boolean function decomposition, this work presents an approach for construction of interaction graphs. This decomposition technique is also used to reduce the network state space of the cell cycle network of fission yeast for finding the singleton attractors. Some special classes of Boolean functions with respect to the interaction graphs have been discussed. A unique recursive procedure is devised which uses the Cartesian product of sets starting from the set of one-variable Boolean function. Interaction graphs generated with these Boolean functions have only positive/negative edges, and the corresponding state spaces have periodic attractors with length one/two.
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 callDisclaimer: 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.
