Analysis of Boolean functions based on Interaction graphsand their influence in System Biology

Ranjeet Kumar Rout, Santi P Maity, Pabitra Pal Choudhury, Jayanta Kumar Das, SK Sarif Hassan, Hari Pandey

Research output: Contribution to journalArticle

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 term 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 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 that 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.
Original languageEnglish
JournalNeural Computing and Applications
Early online date2 Mar 2019
DOIs
Publication statusE-pub ahead of print - 2 Mar 2019

Fingerprint

Boolean functions
Decomposition
Yeast
Cells
Systems Biology

Keywords

  • Boolean functions
  • Boolean network
  • Interaction Graphs
  • Singleton Attractors
  • Classification

Cite this

Kumar Rout, Ranjeet ; Maity, Santi P ; Choudhury, Pabitra Pal ; Kumar Das, Jayanta ; Hassan, SK Sarif ; Pandey, Hari. / Analysis of Boolean functions based on Interaction graphsand their influence in System Biology. In: Neural Computing and Applications. 2019.
@article{4314e5933a7a4426968da78a3d2ea38e,
title = "Analysis of Boolean functions based on Interaction graphsand 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 term 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 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 that 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.",
keywords = "Boolean functions, Boolean network, Interaction Graphs, Singleton Attractors, Classification",
author = "{Kumar Rout}, Ranjeet and Maity, {Santi P} and Choudhury, {Pabitra Pal} and {Kumar Das}, Jayanta and Hassan, {SK Sarif} and Hari Pandey",
year = "2019",
month = "3",
day = "2",
doi = "10.1007/s00521-019-04102-2(0123456789().,-volV)(0123456789,-().volV)",
language = "English",
journal = "Neural Computing and Applications",
issn = "0941-0643",
publisher = "springer",

}

Analysis of Boolean functions based on Interaction graphsand their influence in System Biology. / Kumar Rout, Ranjeet; Maity, Santi P; Choudhury, Pabitra Pal; Kumar Das, Jayanta; Hassan, SK Sarif; Pandey, Hari.

In: Neural Computing and Applications, 02.03.2019.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Analysis of Boolean functions based on Interaction graphsand their influence in System Biology

AU - Kumar Rout, Ranjeet

AU - Maity, Santi P

AU - Choudhury, Pabitra Pal

AU - Kumar Das, Jayanta

AU - Hassan, SK Sarif

AU - Pandey, Hari

PY - 2019/3/2

Y1 - 2019/3/2

N2 - 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 term 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 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 that 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.

AB - 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 term 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 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 that 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.

KW - Boolean functions

KW - Boolean network

KW - Interaction Graphs

KW - Singleton Attractors

KW - Classification

UR - http://www.scopus.com/inward/record.url?scp=85062730882&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85062730882&partnerID=8YFLogxK

U2 - 10.1007/s00521-019-04102-2(0123456789().,-volV)(0123456789,-().volV)

DO - 10.1007/s00521-019-04102-2(0123456789().,-volV)(0123456789,-().volV)

M3 - Article

JO - Neural Computing and Applications

JF - Neural Computing and Applications

SN - 0941-0643

ER -