Aggregation Algorithm Towards Large-Scale Boolean Network Analysis

The analysis of large-scale Boolean network dynamics is of great importance in understanding complex phenomena where systems are characterized by a large number of components. The computational cost to reveal the number of attractors and the period of each attractor increases exponentially as the number of nodes in the networks increases. This paper presents an efficient algorithm to find attractors for medium to large-scale networks. This is achieved by analyzing subnetworks within the network in a way that allows to reveal the attractors of the full network with little computational cost. In particular, for each subnetwork modeled as a Boolean control network, the input-state cycles are found and they are composed to reveal the attractors of the full network. The proposed algorithm reduces the computational cost significantly, especially in finding attractors of short period, or any periods if the aggregation network is acyclic. Also, this paper shows that finding the best acyclic aggregation is equivalent to finding the strongly connected components of the network graph. Finally, the efficiency of the algorithm is demonstrated on two biological systems, namely a T-cell receptor network and an early flower development network.

[1]  Giovanni De Micheli,et al.  An Efficient Method for Dynamic Analysis of Gene Regulatory Networks and in silico Gene Perturbation Experiments , 2007, RECOMB.

[2]  Steffen Klamt,et al.  A methodology for the structural and functional analysis of signaling and regulatory networks , 2006, BMC Bioinformatics.

[3]  S. Kauffman.  Metabolic stability and epigenesis in randomly constructed genetic nets. , 1969, Journal of theoretical biology.

[4]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[5]  Narsingh Deo,et al.  On Algorithms for Enumerating All Circuits of a Graph , 1976, SIAM J. Comput..

[6]  Daizhan Cheng,et al.  A Linear Representation of Dynamics of Boolean Networks , 2010, IEEE Transactions on Automatic Control.

[7]  E. Davidson,et al.  Modeling transcriptional regulatory networks. , 2002, BioEssays : news and reviews in molecular, cellular and developmental biology.

[8]  Robert D. Leclerc.  Survival of the sparsest: robust gene networks are parsimonious , 2008, Molecular systems biology.

[9]  Michael J. Watts,et al.  IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS Publication Information , 2020, IEEE Transactions on Neural Networks and Learning Systems.

[10]  T. Helikar,et al.  Emergent decision-making in biological signal transduction networks , 2008, Proceedings of the National Academy of Sciences.

[11]  Daizhan Cheng,et al.  Input-state incidence matrix of Boolean control networks and its applications , 2010, Syst. Control. Lett..

[12]  John Maloney,et al.  Finding Cycles in Synchronous Boolean Networks with Applications to Biochemical Systems , 2003, Int. J. Bifurc. Chaos.

[13]  Réka Albert,et al.  Boolean modeling of transcriptome data reveals novel modes of heterotrimeric G-protein action , 2010, Molecular systems biology.

[14]  Ting Chen,et al.  Modeling Gene Expression with Differential Equations , 1998, Pacific Symposium on Biocomputing.

[15]  Francesco Masulli,et al.  A survey of kernel and spectral methods for clustering , 2008, Pattern Recognit..

[16]  S Fuhrman,et al.  Reveal, a general reverse engineering algorithm for inference of genetic network architectures. , 1998, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.

[17]  R. Albert,et al.  Discrete dynamic modeling of cellular signaling networks. , 2009, Methods in enzymology.

[18]  Kwang-Hyun Cho,et al.  Reduction of Complex Signaling Networks to a Representative Kernel , 2011, Science Signaling.

[19]  D. Cheng,et al.  Analysis and control of Boolean networks: A semi-tensor product approach , 2010, 2009 7th Asian Control Conference.

[20]  Er-Wei Bai,et al.  A Web Aggregation Approach for Distributed Randomized PageRank Algorithms , 2012, IEEE Transactions on Automatic Control.

[21]  Qianchuan Zhao,et al.  A remark on "Scalar equations for synchronous Boolean networks with biological Applications" by C. Farrow, J. Heidel, J. Maloney, and J. Rogers , 2005, IEEE Transactions on Neural Networks.

[22]  Daizhan Cheng,et al.  Approximation of boolean networks , 2012, Proceedings of the 10th World Congress on Intelligent Control and Automation.

[23]  Tamer Kahveci,et al.  Scalable Steady State Analysis of Boolean Biological Regulatory Networks , 2009, PloS one.

[24]  Terence P. Speed,et al.  Sparse combinatorial inference with an application in cancer biology , 2009, Bioinform..

[25]  Hidde de Jong,et al.  Modeling and Simulation of Genetic Regulatory Systems: A Literature Review , 2002, J. Comput. Biol..

[26]  Daizhan Cheng,et al.  Model Construction of Boolean Network via Observed Data , 2011, IEEE Transactions on Neural Networks.

[27]  Donald B. Johnson,et al.  Finding All the Elementary Circuits of a Directed Graph , 1975, SIAM J. Comput..

[28]  E. Meyerowitz,et al.  Genome-Wide Analysis of Gene Expression during Early Arabidopsis Flower Development , 2006, PLoS genetics.

[29]  E A Leicht,et al.  Community structure in directed networks. , 2007, Physical review letters.

[30]  H. Othmer,et al.  The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in Drosophila melanogaster. , 2003, Journal of theoretical biology.