Paper Info
Title
Analysis of Boolean functions based on interaction graphs and their influence in system biology
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.
Year
DOI
Venue
2020
10.1007/s00521-019-04102-2
Neural Computing and Applications
Keywords
DocType
Volume
Boolean functions, Boolean networks, Interaction graphs, Singleton attractors, Classification
Journal
32
Issue
ISSN
Citations 
12
0941-0643
0
PageRank 
References 
Authors
0.34
0
6
Name
Order
Citations
PageRank
Ranjeet Kumar Rout1103.23
Santi P. Maity240350.37
Pabitra Pal Choudhury36928.27
Jayanta Kumar Das411.36
Sk. Sarif Hassan500.34
Hari Mohan Pandey622.39