A Novel Technique for Reduction of False Positives in Predicted Gene Regulatory Networks
10 Sep 2015-pp 71-83
TL;DR: Experimental results suggest that the proposed methodology is capable of reducing the number of false positives, thus, increasing the overall accuracy and the biological plausibility of the predicted genetic networks.
Abstract: In this paper, we have proposed a novel method for the reduction of the number of inferred false positives in gene regulatory networks, constructed from time-series microarray genetic expression datasets. We have implemented a hybrid statistical/swarm intelligence technique for the purpose of reverse engineering genetic networks from temporal expression data. The theory of combination has been used to reduce the search space of network topologies effectively. Recurrent neural networks have been employed to obtain the underlying dynamics of the expression data accurately. Two swarm intelligence techniques, namely, Particle Swarm Optimisation and a Bat Algorithm inspired variant of the same, have been used to train the corresponding model parameters. Subsequently, we have identified and used their common portions to construct a final network where the incorrect predictions have been filtered out. We have done preliminary investigations on experimental (in vivo) data sets of the real-world SOS DNA repair network in Escherichia coli. Furthermore, we have implemented our proposed algorithm on medium-scale networks, consisting of 10 and 20 genes. Experimental results are quite encouraging, and they suggest that the proposed methodology is capable of reducing the number of false positives, thus, increasing the overall accuracy and the biological plausibility of the predicted genetic networks.
References
More filters
••
04 Oct 1995TL;DR: The optimization of nonlinear functions using particle swarm methodology is described and implementations of two paradigms are discussed and compared, including a recently developed locally oriented paradigm.
Abstract: The optimization of nonlinear functions using particle swarm methodology is described. Implementations of two paradigms are discussed and compared, including a recently developed locally oriented paradigm. Benchmark testing of both paradigms is described, and applications, including neural network training and robot task learning, are proposed. Relationships between particle swarm optimization and both artificial life and evolutionary computation are reviewed.
14,477 citations
••
TL;DR: The hypothesis that contemporary organisms are also randomly constructed molecular automata is examined by modeling the gene as a binary (on-off) device and studying the behavior of large, randomly constructed nets of these binary “genes”.
4,250 citations
•
TL;DR: The Bat Algorithm as mentioned in this paper is based on the echolocation behavior of bats and combines the advantages of existing algorithms into the new bat algorithm to solve many tough optimization problems.
Abstract: Metaheuristic algorithms such as particle swarm optimization, firefly algorithm and harmony search are now becoming powerful methods for solving many tough optimization problems. In this paper, we propose a new metaheuristic method, the Bat Algorithm, based on the echolocation behaviour of bats. We also intend to combine the advantages of existing algorithms into the new bat algorithm. After a detailed formulation and explanation of its implementation, we will then compare the proposed algorithm with other existing algorithms, including genetic algorithms and particle swarm optimization. Simulations show that the proposed algorithm seems much superior to other algorithms, and further studies are also discussed.
3,528 citations
••
23 Apr 2010TL;DR: The Bat Algorithm as mentioned in this paper is based on the echolocation behavior of bats and combines the advantages of existing algorithms into the new bat algorithm to solve many tough optimization problems.
Abstract: Metaheuristic algorithms such as particle swarm optimization, firefly algorithm and harmony search are now becoming powerful methods for solving many tough optimization problems. In this paper, we propose a new metaheuristic method, the Bat Algorithm, based on the echolocation behaviour of bats. We also intend to combine the advantages of existing algorithms into the new bat algorithm. After a detailed formulation and explanation of its implementation, we will then compare the proposed algorithm with other existing algorithms, including genetic algorithms and particle swarm optimization. Simulations show that the proposed algorithm seems much superior to other algorithms, and further studies are also discussed.
3,162 citations
•
01 Sep 2000
TL;DR: This work presents a graphical representation of biochemical systems, a sequence of models describing purine metabolism, and a model of the tricarboxylic acid cycle in Dictyostelium discoideum, which shows the importance of knowing the initial steps of the Glycolytic-Glycogenolytic pathway.
Abstract: Preface Introduction 1 Graphical representation of biochemical systems 2 Models of biochemical systems 3 From maps to equations 4 Computer simulation 5 Parameter estimation 6 Analytical steady-state evaluation 7 Sensitivity analysis 8 Case study 1 - Anaerobic fermentation pathway in Saccharomyces cerevisiae 9 Case study 2 - diagnosis and refinement of a model of the tricarboxylic acid cycle in Dictyostelium discoideum 10 Case study 3 - A sequence of models describing purine metabolism 11 Case study 4 - Algebraic analysis of the initial steps of the Glycolytic-Glycogenolytic pathway in perfused rat liver 12 Epilogue-Canonical modeling beyond biochemistry Appendix Hints and solutions References Author index Subject index
617 citations