De-redundancy in a random boolean network using knockout
Authors: 
Junxiu Liu, Jufang Dai, Min Su, Shunsheng Zhang, Yifan Hua, Yanhu Wang, Haiping ShuAuthors Info & Claims
Junxiu Liu, Jufang Dai, Min Su, Shunsheng Zhang, Yifan Hua, Yanhu Wang, Haiping ShuAuthors Info & ClaimsPages 132 - 135
Abstract
Random Boolean Network (RBN) is one of the regulatory networks and the state value of its node is a binary variable. The network usually contains complex interaction and redundancy such as redundant nodes and connections. However, redundant nodes and connections often lead to increased computational and analytical complexities. To address these problems, the node knockout method inspired by the gene regulatory networks is applied in this work to reduce the number of the redundant nodes in the RBN. For the purpose of verifying the performance of the method, three control task experiments with different dynamic characteristics are implemented. The results show that the fitness distribution of the RBN after node knockout is similar to the original RBN but the number of nodes is reduced by > 50% compared to the original RBN. This proposed method significantly reduces the computational complexity while maintaining the task completion. Thus this paper provides an alternative solution for the de-redundancy of the RBNs.
References
[1]
Andrew G. Barto, Richard S. Sutton, and Charles W. Anderson. 1983. Neuron-like adaptive elements that can solve difficult learning control problems. IEEE Transactions on Systems, Man and Cybernetics 13, 5 (1983), 834--846.
[2]
Monte Carlo. 1990. Learning in feedforward Boolean networks. Physical Review A 42, 10 (1990), 6210--6218.
[3]
Shannon Fenn and Pablo Moscato. 2017. Target curricula via selection of minimum feature sets: A case study in Boolean networks. Journal of Machine Learning Research 18, 1 (2017), 4070--4095.
[4]
Ronald F. Fox. 1993. Review of Stuart kauffman, the origins of order: self-organization and selection in evolution. Biophysical Journal 65, 6 (1993), 2698--2699.
[5]
Alexander J. Gates, Rion Brattig Correia, Xuan Wang, and Luis M. Rocha. 2021. The effective graph reveals redundancy, canalization, and control pathways in biochemical regulation and signaling. Proceedings of the National Academy of Sciences of the United States of America 118, 12 (2021), e2022598118.
[6]
Carlos Gershenson. 2010. Guiding the self-organization of random Boolean networks. Theory in Biosciences 131, 1 (2010), 181--191.
[7]
Carlos Gershenson, Stuart A. Kauffman, and Ilya Shmulevich. 2006. The role of redundancy in the robustness of random boolean networks. 35--42. arXiv:nlin/0511018
[8]
Jennifer Hallinan, Daniel Bradley, and Janet Wiles. 2006. Effects of constitutive gene expression on the dynamics of random boolean networks. In IEEE Congress on Evolutionary Computation. Vancouver, BC, Canada, 2355--2361.
[9]
Kishore Hari, Uday Ram, and Mohit Kumar Jolly. 2021. Identifying more equal than others edges in diverse biochemical networks. Proceedings of the National Academy of Sciences of the United States of America 118, 16 (2021), e2103698118.
[10]
Inman Harvey and Adrian Thompson. 1997. Through the labyrinth evolution finds a way: A silicon ridge. In Evolvable Systems: From Biology to Hardware. Berlin, Heidelberg, 406--422.
[11]
John S. Mattick Jennifer S. Hallinan, Daniel R. Bradley and Janet Wiles. 2006. Effects of an RNA control layer on the state space of Boolean models of genetic regulatory networks. In IEEE Congress on Evolutionary Computation. Vancouver, BC, Canada, 2551--2555.
[12]
Fredrik Karlsson and Michael Hörnquist. 2007. Order or chaos in Boolean gene networks depends on the mean fraction of canalizing functions. Physica A: Statistical Mechanics and its Applications 384, 2 (2007), 747--757.
[13]
S. A. Kauffman. 1969. Metabolic stability and epigenesis in randomly constructed genetic nets. Journal of Theoretical Biology 22, 3 (1969), 437--467.
[14]
Fangting Li, Tao Long, Ying Lu, Qi Ouyang, and Chao Tang. 2004. The yeast cell-cycle network is robustly designed. Proceedings of the National Academy of Sciences of the United States of America 101, 14 (2004), 4781--4786.
[15]
Junxiu Liu, Hao Lu, Yuling Luo, and Su Yang. 2021. Spiking neural network-based multi-task autonomous learning for mobile robots. Engineering Applications of Artificial Intelligence 104, 1 (2021), 1--11.
[16]
Hao Lu, Junxiu Liu, Yuling Luo, Yifan Hua, Senhui Qiu, and Yongchuang Huang. 2021. An autonomous learning mobile robot using biological reward modulate STDP. Neurocomputing 458, 1 (2021), 308--318.
[17]
Marzieh Nabi-Abdolyousefi and Mehran Mesbahi. 2012. Network identification via node knockout. IEEE Trans. Automat. Control 57, 12 (2012), 3214--3219.
[18]
Andrea Roli, Mattia Manfroni, Carlo Pinciroli, and Mauro Birattari. 2011. On the design of Boolean network robots. In Applications of Evolutionary Computation. Berlin, Heidelberg, 43--52.
[19]
Regina Samaga, Axel Von Kamp, and Steffen Klamt. 2010. Computing combinatorial intervention strategies and failure modes in signaling networks. Journal of Computational Biology 17, 1 (2010), 39--53.
[20]
Roberto Serra, Marco Villani, Alex Graudenzi, Annamaria Colacci, and Stuart A. Kauffman. 2008. The simulation of gene knock-out in scale-free random boolean models of genetic networks. Networks and Heterogeneous Media 3, 2 (2008). 333--343.
[21]
R. Serra, M. Villani, and A. Semeria. 2004. Genetic network models and statistical properties of gene expression data in knock-out experiments. Journal of Theoretical Biology 227, 1 (2004), 149--157.
[22]
Kenneth Stanley. 2002. Evolving neural networks through augmenting topologies. Evolutionary Computation 10, 2 (2002), 99--127.
[23]
Nadia Taou and Michael Lones. 2021. Optimising boolean synthetic regulatory networks to control cell states. IEEE/ACM Transactions on Computational Biology and Bioinformatics 18, 6 (2021), 2649--2658.
[24]
Alexander P. Turner, Michael A. Lones, Luis A. Fuente, Susan Stepney, Leo S. Caves, and Andy M. Tyrrell. 2012. Using artificial epigenetic regulatory networks to control complex tasks within chaotic systems. In Information Processing in Cells and Tissues. Berlin, Heidelberg, 1--11.
[25]
Alan Veliz-Cuba. 2011. Reduction of Boolean network models. Journal of Theoretical Biology 289, 1 (2011), 167--172.
[26]
Gang Yang, Jorge Gómez Tejeda Zañudo, and Réka Albert. 2018. Target control in logical models using the domain of influence of nodes. Frontiers in Physiology 9, 454 (2018), 1--17.
[27]
Jumei Yue, Yongyi Yan, Zhihong Zhang, and Shuqiang Li. 2017. Matrix approach to simplify Boolean networks. In Chinese Control Conference. Dalian, China, 2064--2069.
[28]
Jorge G.T. Zañudo and Réka Albert. 2013. An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks. Chaos 23, 1 (2013), 1--22.
Index Terms
- De-redundancy in a random boolean network using knockout
Recommendations
Traffic-Reduction for High-Availability Seamless Redundancy (HSR) Protocol Using Dual Virtual Paths Algorithm
WCSE '13: Proceedings of the 2013 Fourth World Congress on Software EngineeringThe high-availability seamless redundancy (HSR) protocol provides duplicated frame copies of each sent frame, with zero recovery time. This means that even in cases of node or link failure, the destination node will receive at least one copy from the ...
Exploring correlations in gene expression microarray data for maximum predictive-minimum redundancy biomarker selection and classification
An important issue in the analysis of gene expression microarray data is concerned with the extraction of valuable genetic interactions from high dimensional data sets containing gene expression levels collected for a small sample of assays. Past and ...
Genetic algorithm based redundancy resolution of robot manipulators
ISUMA '95: Proceedings of the 3rd International Symposium on Uncertainty Modelling and AnalysisThis paper presents a genetic algorithm based approach to redundancy resolution of robot manipulators using self-motion topology knowledge. The genetic algorithm presented can work under joint limits and produces end-effector positions with negligible ...
Comments
Information & Contributors
Information
Published In
July 2022
2395 pages
Copyright © 2022 Owner/Author.
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 19 July 2022
Check for updates
Author Tags
Qualifiers
- Poster
Funding Sources
- National Natural Science Foundation of China
- Guangxi Natural Science Fundation
- Basic Ability Enhancement Program for Young and Middle-aged Teachers of Guangxi
Conference
GECCO '22
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 55Total Downloads
- Downloads (Last 12 months)7
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in