Inference of S-system models of genetic networks by solving one-dimensional function optimization problems

Voit and Almeida have proposed the decoupling approach as a method for inferring the S-system models of genetic networks. The decoupling approach defines the inference of a genetic network as a problem requiring the solutions of sets of algebraic equations. The computation can be accomplished in a very short time, as the approach estimates S-system parameters without solving any of the differential equations. Yet the defined algebraic equations are non-linear, which sometimes prevents us from finding reasonable S-system parameters. In this study, we propose a new technique to overcome this drawback of the decoupling approach. This technique transforms the problem of solving each set of algebraic equations into a one-dimensional function optimization problem. The computation can still be accomplished in a relatively short time, as the problem is transformed by solving a linear programming problem. We confirm the effectiveness of the proposed approach through numerical experiments.     

Spark-ITGO: a parallel invasive tumor growth optimization algorithm on spark

Cluster Computing - The rapidly increasing complexity and scale of optimization problems pose challenges to search ability and performance of traditional evolutionary algorithms which could be only...     

A new particle swarm optimization algorithm for noisy optimization problems

We propose a new particle swarm optimization algorithm for problems where objective functions are subject to zero-mean, independent, and identically distributed stochastic noise. While particle swarm optimization has been successfully applied to solve many complex deterministic nonlinear optimization problems, straightforward applications of particle swarm optimization to noisy optimization problems are subject to failure because the noise in objective function values can lead the algorithm to incorrectly identify positions as the global/personal best positions. Instead of having the entire swarm follow a global best position based on the sample average of objective function values, the proposed new algorithm works with a set of statistically global best positions that include one or more positions with objective function values that are statistically equivalent, which is achieved using a combination of statistical subset selection and clustering analysis. The new PSO algorithm can be seamlessly integrated with adaptive resampling procedures to enhance the capability of PSO to cope with noisy objective functions. Numerical experiments demonstrate that the new algorithm is able to consistently find better solutions than the canonical particle swarm optimization algorithm in the presence of stochastic noise in objective function values with different resampling procedures.     

A delayed neural network method for solving convex optimization problems

In this paper, the delayed projection neural network for a class of solving convex programming problem is proposed. The existence of solution and global exponential stability of the proposed network are proved, which can guarantee to converge at an exact optimal solution of the convex programming problems. Several examples are given to show the effectiveness of the proposed network.     

Maximizing microbial perchlorate degradation using a genetic algorithm: consortia optimization

Microorganisms in consortia perform many tasks more effectively than individual organisms and in addition grow more rapidly and in greater abundance. In this work, experimental datasets were assembled consisting of all possible selected combinations of perchlorate reducing strains of microorganisms and their perchlorate degradation rates were evaluated. A genetic algorithm (GA) methodology was successfully applied to define sets of microbial strains to achieve maximum rates of perchlorate degradation. Over the course of twenty generations of optimization using a GA, we saw a statistically significant 2.06 and 4.08-fold increase in average perchlorate degradation rates by consortia constructed using solely the perchlorate reducing bacteria (PRB) and by consortia consisting of PRB and accompanying organisms that did not degrade perchlorate, respectively. The comparison of kinetic rates constant in two types of microbial consortia additionally showed marked increases.     

The problems of parallel infusion

The parallel infusion of gravity and pump systems on the same vascular access bears dangers for the patient. Occlusions of the vascular access will not be recognized by pump alarm and bolus applications of accumulated drugs can occur. All means to avoid this problem are up to now not satisfying. Especially the use of one-way-valves is not a solution for every case.     

Maximizing microbial degradation of perchlorate using a genetic algorithm: Media optimization

Microbial communities are under constant influence of physical and chemical components in ecosystems. Shifts in conditions such as pH, temperature or carbon source concentration can translate into shifts in overall ecosystem functioning. These conditions can be manipulated in a laboratory setup using evolutionary computation methods such as genetic algorithms (GAs). In work described here, a GA methodology was successfully applied to define sets of environmental conditions for microbial enrichments and pure cultures to achieve maximum rates of perchlorate degradation. Over the course of 11 generations of optimization using a GA, we saw a statistically significant 16.45 and 16.76-fold increases in average perchlorate degradation rates by Dechlorosoma sp. strain KJ and Dechloromonas sp. strain Miss R, respectively. For two bacterial consortia, Pl6 and Cw3, 5.79 and 5.75-fold increases in average perchlorate degradation were noted. Comparison of zero-order kinetic rate constants for environmental conditions in GA-determined first and last generations of all bacterial cultures additionally showed marked increases.     

GASCO: genetic algorithm simulation for codon optimization

Codon optimization is a generic technique to achieve optimum expression of a foreign gene in the host's cell system. Selection of optimum codons depends on codon usage of the host genome and the presence of several desirable and undesirable sequence motifs. Searching these motifs in all possible combinations of the codons increases the search space exponentially with respect to sequence length. GASCO is an algorithm developed for the optimum codon selection using genetic algorithms. The algorithm reduces the search space and provides an approximate solution to the problem. The algorithm has applications in DNA vaccine design for successfully eliciting potent immune responses and synthetic gene design for metabolic pathway engineering. The software for the proposed algorithm is available on http://miracle.igib.res.in/gasco/.     

Determination of a unique solution to parallel proton transfer reactions using the genetic algorithm

Kinetic analysis of the dynamics as measured in multiequilibria systems is readily attained by curve-fitting methodologies, a treatment that can accurately retrace the shape of the measured signal. Still, these reconstructions are not related to the detailed mechanism of the process. In this study we subjected multiple proton transfer reactions to rigorous kinetic analysis, which consists of solving a set of coupled-nonlinear differential rate equations. The manual analysis of such systems can be biased by the operator; thus the analysis calls for impartial corroboration. What is more, there is no assurance that such a complex system has a unique solution. In this study, we used the Genetic Algorithm to investigate whether the solution of the system will converge into a single global minimum in the multidimensional parameter space. The experimental system consisted of proton transfer between four proton-binding sites with seven independent adjustable parameters. The results of the search indicate that the solution is unique and all adjustable parameters converge into a single minimum in the multidimensional parameter space, thus corroborating the accuracy of the manual analysis.     

A Boltzmann filter improves the prediction of RNA folding pathways in a massively parallel genetic algorithm

RNA folding using the massively parallel genetic algorithm (GA) has been enhanced by the addition of a Boltzmann filter. The filter uses the Boltzmann probability distribution in conjunction with Metropolis' relaxation algorithm. The combination of these two concepts within the GA's massively parallel computational environment helps guide the genetic algorithm to more accurately reflect RNA folding pathways and thus final solution structures. Helical regions (base-paired stems) now form in the structures based upon the stochastic properties of the thermodynamic parameters that have been determined from experiments. Thus, structural changes occur based upon the relative energetic impact that the change causes rather than just geometric conflicts alone. As a result, when comparing the predictions to phylogenetically determined structures, over multiple runs, fewer false-positive stems (predicted incorrectly) and more true-positive stems (predicted correctly) are generated, and the total number of predicted stems representing a solution is diminished. In addition, the significance (rate of occurrence) of the true-positive stems is increased. Thus, the predicted results more accurately reflect phylogenetically determined structures.     

The massively parallel genetic algorithm for RNA folding: MIMD implementation and population variation

A massively parallel Genetic Algorithm (GA) has been applied to RNA sequence folding on three different computer architectures. The GA, an evolution-like algorithm that is applied to a large population of RNA structures based on a pool of helical stems derived from an RNA sequence, evolves this population in parallel. The algorithm was originally designed and developed for a 16384 processor SIMD (Single Instruction Multiple Data) MasPar MP-2. More recently it has been adapted to a 64 processor MIMD (Multiple Instruction Multiple Data) SGI ORIGIN 2000, and a 512 processor MIMD CRAY T3E. The MIMD version of the algorithm raises issues concerning RNA structure data-layout and processor communication. In addition, the effects of population variation on the predicted results are discussed. Also presented are the scaling properties of the algorithm from the perspective of the number of physical processors utilized and the number of virtual processors (RNA structures) operated upon.     

A novel approach for solving constrained nonlinear optimization problems using neurofuzzy systems

A neural network model for solving constrained nonlinear optimization problems with bounded variables is presented in this paper. More specifically, a modified Hopfield network is developed and its internal parameters are computed using the valid-subspace technique. These parameters guarantee the convergence of the network to the equilibrium points. The network is shown to be completely stable and globally convergent to the solutions of constrained nonlinear optimization problems. A fuzzy logic controller is incorporated in the network to minimize convergence time. Simulation results are presented to validate the proposed approach.     

An efficient harris hawk optimization algorithm for solving the travelling salesman problem

Cluster Computing - Travelling Salesman Problem (TSP) is an Np-Hard problem, for which various solutions have been offered so far. Using the Harris Hawk Optimization (HHO) algorithm, this paper...     

Computational optimization for S-type biological systems: Cockroach genetic algorithm

S-type biological systems (S-systems) are demonstrated to be universal approximations of continuous biological systems. S-systems are easy to be generalized to large systems. The systems are identified through data-driven identification techniques (cluster-based algorithms or computational methods). However, S-systems′ identification is challenging because multiple attractors exist in such highly nonlinear systems. Moreover, in some biological systems the interactive effect cannot be neglected even the interaction order is small. Therefore, learning should be focused on increasing the gap between the true and redundant interaction. In addition, a wide searching space is necessary because no prior information is provided. The used technologies should have the ability to achieve convergence enhancement and diversity preservation. Cockroaches live in nearly all habitats and survive for more than 300 million years. In this paper, we mimic cockroaches′ competitive swarm behavior and integrated it with advanced evolutionary operations. The proposed cockroach genetic algorithm (CGA) possesses strong snatching-food ability to rush forward to a target and high migration ability to escape from local minimum. CGA was tested with three small-scale systems, a twenty-state medium-scale system and a thirty-state large-scale system. A wide search space ([0, 100] for rate constants and [−100, 100] for kinetic orders) with random or bad initial starts are used to show the high exploration performance.     

Parameter optimization and sensitivity analysis for large kinetic models using a real-coded genetic algorithm

Dynamic modeling is a powerful tool for predicting changes in metabolic regulation. However, a large number of input parameters, including kinetic constants and initial metabolite concentrations, are required to construct a kinetic model. Therefore, it is important not only to optimize the kinetic parameters, but also to investigate the effects of their perturbations on the overall system. We investigated the efficiency of the use of a real-coded genetic algorithm (RCGA) for parameter optimization and sensitivity analysis in the case of a large kinetic model involving glycolysis and the pentose phosphate pathway in Escherichia coli K-12. Sensitivity analysis of the kinetic model using an RCGA demonstrated that the input parameter values had different effects on model outputs. The results showed highly influential parameters in the model and their allowable ranges for maintaining metabolite-level stability. Furthermore, it was revealed that changes in these influential parameters may complement one another. This study presents an efficient approach based on the use of an RCGA for optimizing and analyzing parameters in large kinetic models.     

A genetic algorithm approach to optimization of asynchronous automatic assembly systems

This paper presents the application of genetic algorithms to the performance optimization of asynchronous automatic assembly systems (AAS). These stochastic systems are subject to blocking and starvation effects that make complete analytic performance modeling difficult. Therefore, this paper extends genetic algorithms to stochastic systems. The performance of the genetic algorithm is measured through comparison with the results of stochastic quasi-gradient (SQM) methods to the same AAS. The genetic algorithm performs reasonably well in obtaining good solutions (as compared with results of SQM) in this stochastic optimization example, even though genetic algorithms were designed for application to deterministic systems. However, the genetic algorithm's performance does not appear to be superior to SQM.     

Medium optimization for the production of the aroma compound 2-phenylethanol using a genetic algorithm

Using a genetic algorithm, 13 medium constituents and the temperature were varied to improve the bioconversion of -phenylalanine ( -phe) to 2-phenylethanol (2-PE) with Kluyveromyces marxianus CBS 600. Within four generations plus an additional temperature screening, corresponding to 98 parallel experiments altogether, a maximum 2-PE concentration of 5.6 g/l, equivalent to an increase of 87% compared to the non-optimized medium was obtained. The vitamin content of the medium had to be raised significantly.