Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

A Boolean network control algorithm guided by forward dynamic programming.

ABSTRACT: Control problem in a biological system is the problem of finding an interventional policy for changing the state of the biological system from an undesirable state, e.g. disease, into a desirable healthy state. Boolean networks are utilized as a mathematical model for gene regulatory networks. This paper provides an algorithm to solve the control problem in Boolean networks. The proposed algorithm is implemented and applied on two biological systems: T-cell receptor network and Drosophila melanogaster network. Results show that the proposed algorithm works faster in solving the control problem over these networks, while having similar accuracy, in comparison to previous exact methods. Source code and a simple web service of the proposed algorithm is available at http://goliaei.ir/net-control/www/.

SUBMITTER: Moradi M

PROVIDER: S-EPMC6497256 | biostudies-literature | 2019

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

A Boolean network control algorithm guided by forward dynamic programming.

Moradi Mohammad M Goliaei Sama S Foroughmand-Araabi Mohammad-Hadi MH

PloS one 20190502 5

Control problem in a biological system is the problem of finding an interventional policy for changing the state of the biological system from an undesirable state, e.g. disease, into a desirable healthy state. Boolean networks are utilized as a mathematical model for gene regulatory networks. This paper provides an algorithm to solve the control problem in Boolean networks. The proposed algorithm is implemented and applied on two biological systems: T-cell receptor network and Drosophila melano ...[more]

PMID: 31048917

Similar Datasets

COSMO: A dynamic programming algorithm for multicriteria codon optimization.

Project description:Codon optimization in protein-coding sequences (CDSs) is a widely used technique to promote the heterologous expression of target genes. In codon optimization, a combinatorial space of nucleotide sequences that code a given amino acid sequence and take into account user-prescribed forbidden sequence motifs is explored to optimize multiple criteria. Although evolutionary algorithms have been used to tackle such complex codon optimization problems, evolutionary codon optimization tools do not provide guarantees to find the optimal solutions for these multicriteria codon optimization problems. We have developed a novel multicriteria dynamic programming algorithm, COSMO. By using this algorithm, we can obtain all Pareto-optimal solutions for the multiple features of CDS, which include codon usage, codon context, and the number of hidden stop codons. User-prescribed forbidden sequence motifs are rigorously excluded from the Pareto-optimal solutions. To accelerate CDS design by COSMO, we introduced constraints that reduce the number of Pareto-optimal solutions to be processed in a branch-and-bound manner. We benchmarked COSMO for run-time and the number of generated solutions by adapting selected human genes to yeast codon usage frequencies, and found that the constraints effectively reduce the run-time. In addition to the benchmarking of COSMO, a multi-objective genetic algorithm (MOGA) for CDS design was also benchmarked for the same two aspects and their performances were compared. In this comparison, (i) MOGA identified significantly fewer Pareto-optimal solutions than COSMO, and (ii) the MOGA solutions did not achieve the same mean hypervolume values as those provided by COSMO. These results suggest that generating the whole set of the Pareto-optimal solutions of the codon optimization problems is a difficult task for MOGA.

| S-EPMC7358382 | biostudies-literature

Determining Relative Dynamic Stability of Cell States Using Boolean Network Model.

Project description:Cell state transition is at the core of biological processes in metazoan, which includes cell differentiation, epithelial-to-mesenchymal transition (EMT) and cell reprogramming. In these cases, it is important to understand the molecular mechanism of cellular stability and how the transitions happen between different cell states, which is controlled by a gene regulatory network (GRN) hard-wired in the genome. Here we use Boolean modeling of GRN to study the cell state transition of EMT and systematically compare four available methods to calculate the cellular stability of three cell states in EMT in both normal and genetically mutated cases. The results produced from four methods generally agree but do not totally agree with each other. We show that distribution of one-degree neighborhood of cell states, which are the nearest states by Hamming distance, causes the difference among the methods. From that, we propose a new method based on one-degree neighborhood, which is the simplest one and agrees with other methods to estimate the cellular stability in all scenarios of our EMT model. This new method will help the researchers in the field of cell differentiation and cell reprogramming to calculate cellular stability using Boolean model, and then rationally design their experimental protocols to manipulate the cell state transition.

| S-EPMC6089891 | biostudies-other

Multiple input algorithm-guided Deep Brain stimulation-programming for Parkinson's disease patients.

Project description:Technological advances of Deep Brain Stimulation (DBS) within the subthalamic nucleus (STN) for Parkinson's disease (PD) provide increased programming options with higher programming burden. Reducing the effort of DBS optimization requires novel programming strategies. The objective of this study was to evaluate the feasibility of a semi-automatic algorithm-guided-programming (AgP) approach to obtain beneficial stimulation settings for PD patients with directional DBS systems. The AgP evaluates iteratively the weighted combination of sensor and clinician assessed responses of multiple PD symptoms to suggested DBS settings until it converges to a final solution. Acute clinical effectiveness of AgP DBS settings and DBS settings that were found following a standard of care (SoC) procedure were compared in a randomized, crossover and double-blind fashion in 10 PD subjects from a single center. Compared to therapy absence, AgP and SoC DBS settings significantly improved (p = 0.002) total Unified Parkinson's Disease Rating Scale III scores (median 69.8 interquartile range (IQR) 64.6|71.9% and 66.2 IQR 58.1|68.2%, respectively). Despite their similar clinical results, AgP and SoC DBS settings differed substantially. Per subject, AgP tested 37.0 IQR 34.0|37 settings before convergence, resulting in 1.7 IQR 1.6|2.0 h, which is comparable to previous reports. Although AgP long-term clinical results still need to be investigated, this approach constitutes an alternative for DBS programming and represents an important step for future closed-loop DBS optimization systems.

| S-EPMC9617933 | biostudies-literature

A generalized speckle tracking algorithm for ultrasonic strain imaging using dynamic programming.

Project description:This study developed an improved motion estimation algorithm for ultrasonic strain imaging that employs a dynamic programming technique. In this article, we model the motion estimation task as an optimization problem. Since tissue motion under external mechanical stimuli often should be reasonably continuous, a set of cost functions combining correlation and various levels of motion continuity constraint were used to regularize the motion estimation. To solve the optimization problem with a reasonable computational load, a dynamic programming technique that does not require iterations was used to obtain displacement vectors in integer precision. Then, a subsample estimation algorithm was used to calculate local displacements in fractional precision. Two implementation schemes were investigated with in vivo ultrasound echo data sets. We found that the proposed algorithm provides more accurate displacement estimates than our previous algorithm for in vivo clinical data. In particular, the new algorithm is capable of tracking motion in more complex anatomy and increases strain image consistency in a sequence of images. Preliminary results also suggest that a significantly longer sequence of high contrast strain images could be obtained with the new algorithm compared with the previous algorithm. The new algorithm can also tolerate larger motion discontinuities (e.g., cavity in an anthropomorphic uterine phantom).

| S-EPMC2843521 | biostudies-literature

Smart grid energy scheduling based on improved dynamic programming algorithm and LSTM.

Project description:The optimal scheduling of energy in a smart grid is crucial to the energy consumption of the entire grid. In fact, for larger grids, intelligent scheduling may result in substantial energy savings. Herein, we introduce an enhanced dynamic programming algorithm (DPA) that utilizes two state variables to derive the optimal power supply schedule. The algorithm accounts for the dynamic states of both batteries and supercapacitors in the power supply system to augment the performance of the dynamic programming model. Additionally, this study incorporates a long short-term memory (LSTM) deep learning model, which integrates various environmental factors such as temperature, humidity, wind, and precipitation to predict grid power consumption. This serves as a mid-point pre-processing step for smart grid energy consumption scheduling. Our simulation experiments confirm that the proposed method significantly reduces energy consumption, surpassing similar grid energy consumption scheduling algorithms. This is critical for the establishment of smart grids and the reduction of energy consumption and emissions.

| S-EPMC10403179 | biostudies-literature

Artificial dragonfly algorithm in the Hopfield neural network for optimal Exact Boolean k satisfiability representation.

Project description:This study proposes a novel hybrid computational approach that integrates the artificial dragonfly algorithm (ADA) with the Hopfield neural network (HNN) to achieve an optimal representation of the Exact Boolean kSatisfiability (EBkSAT) logical rule. The primary objective is to investigate the effectiveness and robustness of the ADA algorithm in expediting the training phase of the HNN to attain an optimized EBkSAT logic representation. To assess the performance of the proposed hybrid computational model, a specific Exact Boolean kSatisfiability problem is constructed, and simulated data sets are generated. The evaluation metrics employed include the global minimum ratio (GmR), root mean square error (RMSE), mean absolute percentage error (MAPE), and network computational time (CT) for EBkSAT representation. Comparative analyses are conducted between the results obtained from the proposed model and existing models in the literature. The findings demonstrate that the proposed hybrid model, ADA-HNN-EBkSAT, surpasses existing models in terms of accuracy and computational time. This suggests that the ADA algorithm exhibits effective compatibility with the HNN for achieving an optimal representation of the EBkSAT logical rule. These outcomes carry significant implications for addressing intricate optimization problems across diverse domains, including computer science, engineering, and business.

| S-EPMC10519610 | biostudies-literature

A modified weighted chimp optimization algorithm for training feed-forward neural network.

Project description:Swarm intelligence algorithms (SI) have an excellent ability to search for the optimal solution and they are applying two mechanisms during the search. The first mechanism is exploration, to explore a vast area in the search space, and when they found a promising area they switch from the exploration to the exploitation mechanism. A good SI algorithm can balance the exploration and the exploitation mechanism. In this paper, we propose a modified version of the chimp optimization algorithm (ChOA) to train a feed-forward neural network (FNN). The proposed algorithm is called a modified weighted chimp optimization algorithm (MWChOA). The main drawback of the standard ChOA and the weighted chimp optimization algorithm (WChOA) is they can be trapped in local optima because most of the solutions update their positions based on the position of the four leader solutions in the population. In the proposed algorithm, we reduced the number of leader solutions from four to three, and we found that reducing the number of leader solutions enhances the search and increases the exploration phase in the proposed algorithm, and avoids trapping in local optima. We test the proposed algorithm on the Eleven dataset and compare it against 16 SI algorithms. The results show that the proposed algorithm can achieve success to train the FNN when compare to the other SI algorithms.

| S-EPMC10047527 | biostudies-literature

Human Boolean Implication Network

Project description:Numerous gene expression datasets from diverse human tissue samples have been already deposited in the public domain. There have been several attempts to do large scale meta-analyses of all of these datasets. Most of these analyses summarize pairwise gene expression relationships using correlation, or identify differentially expressed genes in two conditions. We propose here a new large scale meta-analysis of all of the publicly available human datasets to identify Boolean logical relationships between genes. Boolean logic is a branch of mathematics that deals with two possible values. In the context of gene expression datasets we use qualitative high and low expression values. A strong logical relationship between genes emerges if at least one of the quadrants is sparsely populated.

2018-08-29 | GSE119087 | GEO

Mouse Boolean Implication Network

Project description:Numerous gene expression datasets from diverse mouse tissue samples have been already deposited in the public domain. There have been several attempts to do large scale meta-analyses of all of these datasets. Most of these analyses summarize pairwise gene expression relationships using correlation, or identify differentially expressed genes in two conditions. We propose here a new large scale meta-analysis of all of the publicly available mouse datasets to identify Boolean logical relationships between genes. Boolean logic is a branch of mathematics that deals with two possible values. In the context of gene expression datasets we use qualitative high and low expression values. A strong logical relationship between genes emerges if at least one of the quadrants is sparsely populated.

2018-08-29 | GSE119085 | GEO

Fly Boolean Implication Network

Project description:Numerous gene expression datasets from diverse fly tissue samples have been already deposited in the public domain. There have been several attempts to do large scale meta-analyses of all of these datasets. Most of these analyses summarize pairwise gene expression relationships using correlation, or identify differentially expressed genes in two conditions. We propose here a new large scale meta-analysis of all of the publicly available fly datasets to identify Boolean logical relationships between genes. Boolean logic is a branch of mathematics that deals with two possible values. In the context of gene expression datasets we use qualitative high and low expression values. A strong logical relationship between genes emerges if at least one of the quadrants is sparsely populated.

2018-08-29 | GSE119084 | GEO

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data