Search

Abstract: The Estimation of Distribution Algorithms are a class of evolutionary algorithms which adopt probabilistic models to reproduce individuals in the next generation, instead of conventional crossover and mutation operators. In this paper, mutation operators are incorporated into Estimation of Distribution Algorithms in order to maintain the diversities in EDA populations. Two kinds of mutation operators are examined: a bitwise mutation operator and a mutation operator taking account into the probabilistic model. In experiments, we do not only compare the proposed methods with conventional EDAs on a few fitness functions but also analyze sampled probabilistic models by using KL-divergence. The experimental results shown in this paper elucidate that the mutation operator taking account into the probabilistic model improve the search ability of EDAs. [Copyright &y& Elsevier]

Adleman wrote the first paper in which it is shown that deoxyribonucleic acid (DNA) strands could be employed towards calculating solutions to an instance of the NP-complete Hamiltonian path problem (HPP). Lipton also demonstrated that Adleman’s techniques could be used to solve the NP-complete satisfiability (SAT) problem (the first NP-complete problem). In this paper, it is proved how the DNA operations presented by Adleman and Lipton can be used for developing DNA algorithms to resolving the set cover problem and the problem of exact cover by 3-sets. [Copyright &y& Elsevier]

Cryptography is a method for preventing illegitimate access to information and data. In this paper, a bio-inspired cryptographic DNA system has been proposed. The proposed method consists of three phases: encryption, key generation and decryption. The scheme is proposed, from reproducing the normal procedures in the genetic encoding, transcription and translation and some of the inverse procedures have been used for the encryption and decryption of the data. And also for the encryption and decryption algorithms, it concentrates on the Central Dogma of Molecular Biology (CMDB).Thus, to store in the memory storage, a Bidirectional Associative Memory Neural Network (BAMNN) is used by recognizing and restoring the set of keys in present mode, and it is used educated in the randomized important generation information. Here, Whale Optimization Algorithm (WOA) is the highest fit weight vector. The proposed bio-instrumented encrypting system consists of adequate encoding as well as the decryption times, even though when the data is correlated in larger sizes in the current systems. Different safety attacks analyze the efficiency of the cryptosystem. This paper explored efficiency of the WOA algorithm by changing the number of hidden and input neurons. The proposed method is compared with traditional cryptographic techniques results in 55 and 67% increased processing time for encryption process and decryption process respectively. [ABSTRACT FROM AUTHOR]

In this paper we introduce the concept of a BDA-generated model of the genetic code which is based on binary dichotomic algorithms (BDAs). A BDA-generated model is based on binary dichotomic algorithms (BDAs). Such a BDA partitions the set of 64 codons into two disjoint classes of size 32 each and provides a generalization of known partitions like the Rumer dichotomy. We investigate what partitions can be generated when a set of different BDAs is applied sequentially to the set of codons. The search revealed that these models are able to generate code tables with very different numbers of classes ranging from 2 to 64. We have analyzed whether there are models that map the codons to their amino acids. A perfect matching is not possible. However, we present models that describe the standard genetic code with only few errors. There are also models that map all 64 codons uniquely to 64 classes showing that BDAs can be used to identify codons precisely. This could serve as a basis for further mathematical analysis using coding theory, for example. The hypothesis that BDAs might reflect a molecular mechanism taking place in the decoding center of the ribosome is discussed. The scan demonstrated that binary dichotomic partitions are able to model different aspects of the genetic code very well. The search was performed with our tool Beady-A. This software is freely available at http://mi.informatik.hs-mannheim.de/beady-a . It requires a JVM version 6 or higher. [ABSTRACT FROM AUTHOR]

The analysis of evolutionary data allows uncovering information about the organisms and how they have adapted and evolved. This information could provide us with new insights about the specialisation of organisms (or part of them), how they adapt, how similar they are with other species, among others. Unfortunately, this evolutionary history can only be estimated, and for that, several computational methods exist. Among the methods, optimisation methods are one of the main approaches to deal with this problem, with multiobjective optimisation producing promising results. In this paper, we deal with multiobjective phylogenetic inference, using a multi-modal metaheuristic approach that exploits the decision space in the multiobjective formulation of the problem. In particular, we incorporate a new metric based on a topological tree distance. We compare the method with state of the art algorithms in terms of performance. Additionally, we perform a thorough analysis of a study case on a yeast Saccharomyces cerevisiae dataset. Results show that our proposal is able to improve the diversity of solutions while improving or keeping the quality of solutions in terms of hypervolume. [ABSTRACT FROM AUTHOR]

Abstract: Prediction of protein subcellular location is a meaningful task which attracted much attention in recent years. A lot of protein subcellular location predictors which can only deal with the single-location proteins were developed. However, some proteins may belong to two or even more subcellular locations. It is important to develop predictors which will be able to deal with multiplex proteins, because these proteins have extremely useful implication in both basic biological research and drug discovery. Considering the circumstance that the number of methods dealing with multiplex proteins is limited, it is meaningful to explore some new methods which can predict subcellular location of proteins with both single and multiple sites. Different methods of feature extraction and different models of predict algorithms using on different benchmark datasets may receive some general results. In this paper, two different feature extraction methods and two different models of neural networks were performed on three benchmark datasets of different kinds of proteins, i.e. datasets constructed specially for Gram-positive bacterial proteins, plant proteins and virus proteins. These benchmark datasets have different number of location sites. The application result shows that RBF neural network has apparently superiorities against BP neural network on these datasets no matter which type of feature extraction is chosen. [Copyright &y& Elsevier]

Abstract: It is well known that evaluation of parameters for any mathematical model is always very important and often a very difficult problem. This is especially true for agents-based models because as a rule the evaluation of an agent's parameters can be made only based on available information from the higher levels of a complex system. Such problems can be ill-posed or even have a non-unique solution. That is why there is no general algorithm for solving these problems and a researcher has to search for it for every specific model type. In this paper the problem of evaluating transmission probabilities for different age groups during an influenza epidemic/pandemic in a city will be considered. In order to solve this problem a regularization procedure based on illness attack rates for several age groups (cumulated numbers of infected residents as functions of time) is proposed and validated. It can be used for past epidemics to estimate the efficiency or inefficiency of undertaken interventions, to propose new ones and to reveal its advantages and shortcomings. Under some conditions it can be used to model the possible dynamics of a coming epidemic. [Copyright &y& Elsevier]

Abstract: As one of the emerging algorithms in the field of artificial immune systems (AIS), the dendritic cell algorithm (DCA) has been successfully applied to a number of challenging real-world problems. However, one criticism is the lack of a formal definition, which could result in ambiguity for understanding the algorithm. Moreover, previous investigations have mainly focused on its empirical aspects. Therefore, it is necessary to provide a formal definition of the algorithm, as well as to perform runtime analyses to reveal its theoretical aspects. In this paper, we define the deterministic version of the DCA, named the dDCA, using set theory and mathematical functions. Runtime analyses of the standard algorithm and the one with additional segmentation are performed. Our analysis suggests that the standard dDCA has a runtime complexity of for the worst-case scenario, where n is the number of input data instances. The introduction of segmentation changes the algorithm''s worst case runtime complexity to , for DC population size N with size of each segment z. Finally, two runtime variables of the algorithm are formulated based on the input data, to understand its runtime behaviour as guidelines for further development. [Copyright &y& Elsevier]

Abstract: Traffic optimization of railroad networks was considered using an algorithm that was biologically inspired by an amoeba-like organism, plasmodium of the true slime mold, Physarum polycephalum. The organism developed a transportation network consisting of a tubular structure to transport protoplasm. It was reported that plasmodium can find the shortest path interconnecting multiple food sites during an adaptation process (Nakagaki et al., 2001. Biophys. Chem. 92, 47–52). By mimicking the adaptation process a path finding algorithm was developed by . In this paper, the algorithm is newly modified for applications of traffic distribution optimization in transportation networks of infrastructure such as railroads under the constraint that the network topology is given. Application of the algorithm to a railroad in metropolitan Tokyo, Japan is demonstrated. The results are evaluated using three performance functions related to cost, traveling efficiency, and network weakness. The traffic distribution suggests that the modified Physarum algorithm balances the performances under a certain parameter range, indicating a biological process. [Copyright &y& Elsevier]

Abstract: Genomic transposable elements, or transposons, are sequences of DNA that can move to different positions in the genome; in the process, they can cause chromosomal rearrengements and changes in gene expression. Despite their prevalence in the genomes of many species, their function is largely unknown: for this reason, they have been labelled “junk” DNA. “Epigenetic Tracking” is a model of development that, combined with a standard evolutionary algorithm, become an evo-devo method able to generate arbitrary shapes of any kind and complexity (in terms of number of cells, number of colours, etc.). The model of development has been also shown to be able to produce the artificial version of key biological phenomena such as the phenomenon of ageing, and the process of carcinogenesis. In this paper the evo-devo core of the method is explored and the result is a novel hypothesis on the biological role of transposons, according to which transposition in somatic cells during development drives cellular differentiation and transposition in germ cells is an indispensable tool to boost evolution. Thus, transposable elements, far from being “junk”, have one of the most important roles in multicellular biology. [ABSTRACT FROM AUTHOR]

Abstract: Most of evolutionary algorithms (EAs) are based on a fixed population. However, due to this feature, such algorithms do not fully explore the potential of searching ability and are time consuming. This paper presents a novel nature-inspired heuristic optimization algorithm: bacterial foraging algorithm with varying population (BFAVP), based on a more bacterially-realistic model of bacterial foraging patterns, which incorporates a varying population framework and the underlying mechanisms of bacterial chemotaxis, metabolism, proliferation, elimination and quorum sensing. In order to evaluate its merits, BFAVP has been tested on several benchmark functions and the results show that it performs better than other popularly used EAs, in terms of both accuracy and convergency. [Copyright &y& Elsevier]

Abstract: Microarrays have thousands to tens-of-thousands of gene features, but only a few hundred patient samples are available. The fundamental problem in microarray data analysis is identifying genes whose disruption causes congenital or acquired disease in humans. In this paper, we propose a new evolutionary method that can efficiently select a subset of potentially informative genes for support vector machine (SVM) classifiers. The proposed evolutionary method uses SVM with a given subset of gene features to evaluate the fitness function, and new subsets of features are selected based on the estimates of generalization error of SVMs and frequency of occurrence of the features in the evolutionary approach. Thus, in theory, selected genes reflect to some extent the generalization performance of SVM classifiers. We compare our proposed method with several existing methods and find that the proposed method can obtain better classification accuracy with a smaller number of selected genes than the existing methods. [Copyright &y& Elsevier]

Abstract: A major research challenge of multi-robot systems is to predict the emerging behaviors from the local interactions of the individual agents. Biological systems can generate robust and complex behaviors through relatively simple local interactions in a world characterized by rapid changes, high uncertainty, infinite richness, and limited availability of information. Gene Regulatory Networks (GRNs) play a central role in understanding natural evolution and development of biological organisms from cells. In this paper, inspired by biological organisms, we propose a distributed GRN-based algorithm for a multi-robot construction task. Through this algorithm, multiple robots can self-organize autonomously into different predefined shapes, and self-reorganize adaptively under dynamic environments. This developmental process is evolved using a multi-objective optimization algorithm to achieve a shorter travel distance and less convergence time. Furthermore, a theoretical proof of the system''s convergence is also provided. Various case studies have been conducted in the simulation, and the results show the efficiency and convergence of the proposed method. [Copyright &y& Elsevier]

Abstract: Constraint-based approaches recently brought new insight into our understanding of metabolism. By making very simple assumptions such as that the system is at steady-state and some reactions are irreversible, and without requiring kinetic parameters, general properties of the system can be derived. A central concept in this methodology is the notion of an elementary mode (EM for short) which represents a minimal functional subsystem. The computation of EMs still forms a limiting step in metabolic studies and several algorithms have been proposed to address this problem leading to increasingly faster methods. However, although a theoretical upper bound on the number of elementary modes that a network may possess has been established, surprisingly, the complexity of this problem has never been systematically studied. In this paper, we give a systematic overview of the complexity of optimisation problems related to modes. We first establish results regarding network consistency. Most consistency problems are easy, i.e., they can be solved in polynomial time. We then establish the complexity of finding and counting elementary modes. We show in particular that finding one elementary mode is easy but that this task becomes hard when a specific EM (i.e. an EM containing some specified reactions) is sought. We then show that counting the number of elementary modes is P-complete. We emphasize that the easy problems can be solved using currently existing software packages. We then analyse the complexity of a closely related task which is the computation of so-called minimum reaction cut sets and we show that this problem is hard. We then present two positive results which both allow to avoid computing EMs as a prior to the computation of reaction cuts. The first one is a polynomial approximation algorithm for finding a minimum reaction cut set. The second one is a test for verifying whether a set of reactions constitutes a reaction cut; this test can be readily included in existing algorithms to improve their performance. Finally, we discuss the complexity of other cut-related problems. [Copyright &y& Elsevier]

Abstract: Cell pattern generation has a fundamental role in both artificial and natural development. This paper presents results from a model in which a genetic algorithm (GA) was used to evolve an artificial regulatory network (ARN) to produce predefined 2D cell patterns through the selective activation and inhibition of genes. The ARN used in this work is an extension of a model previously used to create simple geometrical patterns. The GA worked by evolving the gene regulatory network that was used to control cell reproduction, which took place in a testbed based on cellular automata (CA). After the final chromosomes were produced, a single cell in the middle of the CA lattice was allowed to replicate controlled by the ARN found by the GA, until the desired cell pattern was formed. The model was applied to the problem of generating a French flag pattern. [Copyright &y& Elsevier]

Abstract: This paper presents a novel evolutionary algorithm inspired by protein/substrate binding exploited in enzyme genetic programming (EGP) and artificial immune networks. The immune network-inspired evolutionary algorithm has been developed in direct response to an application in clinical neurology, the diagnosis of Parkinson’s disease. The inspiration for, and implementation of the algorithm is described and its performance to the application area considered. [Copyright &y& Elsevier]

Abstract: In this paper we present two new algorithms for the layout optimization problem: this concerns the placement of circular, weighted objects inside a circular container, the two objectives being to minimize imbalance of mass and to minimize the radius of the container. This problem carries real practical significance in industrial applications (such as the design of satellites), as well as being of significant theoretical interest. We present two nature-inspired algorithms for this problem, the first based on simulated annealing, and the second on particle swarm optimization. We compare our algorithms with the existing best-known algorithm, and show that our approaches out-perform it in terms of both solution quality and execution time. [Copyright &y& Elsevier]

Abstract: An optimal design of support vector machine (SVM)-based classifiers for prediction aims to optimize the combination of feature selection, parameter setting of SVM, and cross-validation methods. However, SVMs do not offer the mechanism of automatic internal relevant feature detection. The appropriate setting of their control parameters is often treated as another independent problem. This paper proposes an evolutionary approach to designing an SVM-based classifier (named ESVM) by simultaneous optimization of automatic feature selection and parameter tuning using an intelligent genetic algorithm, combined with k-fold cross-validation regarded as an estimator of generalization ability. To illustrate and evaluate the efficiency of ESVM, a typical application to microarray classification using 11 multi-class datasets is adopted. By considering model uncertainty, a frequency-based technique by voting on multiple sets of potentially informative features is used to identify the most effective subset of genes. It is shown that ESVM can obtain a high accuracy of 96.88% with a small number 10.0 of selected genes using 10-fold cross-validation for the 11 datasets averagely. The merits of ESVM are three-fold: (1) automatic feature selection and parameter setting embedded into ESVM can advance prediction abilities, compared to traditional SVMs; (2) ESVM can serve not only as an accurate classifier but also as an adaptive feature extractor; (3) ESVM is developed as an efficient tool so that various SVMs can be used conveniently as the core of ESVM for bioinformatics problems. [Copyright &y& Elsevier]

Abstract: Most multiple gene sequence alignment methods rely on conventions regarding the score of a multiple alignment in pairwise fashion. Therefore, as the number of sequences increases, the runtime of sequencing expands exponentially. In order to solve the problem, this paper presents a multiple sequence alignment method using a linear-time suffix tree algorithm to cluster similar sequences at one time without pairwise alignment. After searching for common subsequences, cross-matching common subsequences were generated, and sometimes inexact matching was found. So, a procedure aimed at masking the inexact cross-matching pairs was suggested here. In addition, BLAST was combined with a clustering tool in order to annotate the clusters generated by suffix tree clustering. The proposed method for clustering and annotating genes consists of the following steps: (1) construction of a suffix tree; (2) searching and overlapping common subsequences; (3) grouping subsequence pairs; (4) masking cross-matching pairs; (5) clustering gene sequences; (6) annotating gene clusters by the BLAST search. The performance of the proposed system, CLAGen, was successfully evaluated with 42 gene sequences in a TCA cycle (a citrate cycle) of bacteria. The system generated 11 clusters and found the longest subsequences of each cluster, which are biologically significant. [Copyright &y& Elsevier]

Abstract: Recently, DNA microarray-based gene expression profiles have been used to correlate the clinical behavior of cancers with the differential gene expression levels in cancerous and normal tissues. To this end, after selection of some predictive genes based on signal-to-noise (S2N) ratio, unsupervised learning like clustering and supervised learning like k-nearest neighbor (k NN) classifier are widely used. Instead of S2N ratio, adaptive searches like Probabilistic Model Building Genetic Algorithm (PMBGA) can be applied for selection of a smaller size gene subset that would classify patient samples more accurately. In this paper, we propose a new PMBGA-based method for identification of informative genes from microarray data. By applying our proposed method to classification of three microarray data sets of binary and multi-type tumors, we demonstrate that the gene subsets selected with our technique yield better classification accuracy. [Copyright &y& Elsevier]

Abstract: In this paper, we present a new DNA-based evaluation algorithm for a Boolean circuit that employs standard bio-molecular techniques. The algorithm operates on an unbounded fan-in Boolean circuit consisting of AND and OR gates. The whole simulation of our algorithm is proposed in a single test tube in O(1) time complexity and is much easier to implement in the laboratory than previously described models. Furthermore, the algorithm allows for evaluating any number of Boolean circuits in parallel in a single test tube. [Copyright &y& Elsevier]

Abstract: Previous research presented DNA computing on surfaces, which applied to each clause three operations:“mark”,“destroy”, and “unmark”, and demonstrated how to solve a four-variable four-clause instance of the 3-SAT. It was claimed that only the strands satisfying the problem remained on the surface at the end of the computation and the surface-based approach was capable of scaling up to larger 3-SAT problems. Accordingly, the identities of the strands were only determined in the“readout” step for the correct solutions to the problem without checking if the strands really satisfied the problem. Thus, based on the claim above, the surface-based approach became a polynomial-time algorithm. In this paper, we show that for some instance of SAT, at the end of the computation all the remaining strands falsify the instance. However, by the previous claim all the strands falsifying the problems would be regarded as the correct solutions to the problems. Therefore, the DNA computing on surfaces is unreliable. For this reason, it is necessary to add a “verify” step after the “readout” step to check if the strands remaining on the surface at the end of the computation really satisfy the problem. [Copyright &y& Elsevier]

Abstract: This paper presents DNA algorithms for five relational algebra database operations, selection, projection, union, set difference, and Cartesian product on so-called DNA databases. A DNA database is a database where data records are encoded as DNA strands. The five operations mentioned before are fundamental in the field of databases and perform most of the data retrieval operations on current databases. [Copyright &y& Elsevier]

Abstract: Brown and Wanger [Brown, R.T., Wanger, A.R., 1964. Resistance to punishment and extinction following training with shock or nonreinforcement. J. Exp. Psychol. 68, 503–507] investigated rat behaviors with the following features: (1) rats were exposed to reward and punishment at the same time, (2) environment changed and rats relearned, and (3) rats were stochastically exposed to reward and punishment. The results are that exposure to nonreinforcement produces resistance to the decremental effects of behavior after stochastic reward schedule and that exposure to both punishment and reinforcement produces resistance to the decremental effects of behavior after stochastic punishment schedule. This paper aims to simulate the rat behaviors by a reinforcement learning algorithm in consideration of appearance probabilities of reinforcement signals. The former algorithms of reinforcement learning were unable to simulate the behavior of the feature (3). We improve the former reinforcement learning algorithms by controlling learning parameters in consideration of the acquisition probabilities of reinforcement signals. The proposed algorithm qualitatively simulates the result of the animal experiment of Brown and Wanger. [Copyright &y& Elsevier]

Abstract: Cook''s Theorem [Cormen, T.H., Leiserson, C.E., Rivest, R.L., 2001. Introduction to Algorithms, second ed., The MIT Press; Garey, M.R., Johnson, D.S., 1979. Computer and Intractability, Freeman, San Fransico, CA] is that if one algorithm for an NP-complete or an NP-hard problem will be developed, then other problems will be solved by means of reduction to that problem. Cook''s Theorem has been demonstrated to be correct in a general digital electronic computer. In this paper, we first propose a DNA algorithm for solving the vertex-cover problem. Then, we demonstrate that if the size of a reduced NP-complete or NP-hard problem is equal to or less than that of the vertex-cover problem, then the proposed algorithm can be directly used for solving the reduced NP-complete or NP-hard problem and Cook''s Theorem is correct on DNA-based computing. Otherwise, a new DNA algorithm for optimal solution of a reduced NP-complete problem or a reduced NP-hard problem should be developed from the characteristic of NP-complete problems or NP-hard problems. [Copyright &y& Elsevier]

Abstract: This paper presents a memetic algorithm, a highly effective evolutionary algorithm incorporating local search for solving the unconstrained binary quadratic programming problem (BQP). To justify the approach, a fitness landscape analysis is conducted experimentally for several instances of the BQP. The results of the analysis show that recombination-based variation operators are well suited for the evolutionary algorithms with local search. Therefore, the proposed approach includes — besides a highly effective randomized k-opt local search — a new variation operator that has been tailored specially for the application in the hybrid evolutionary framework. The operator is called innovative variation and is fundamentally different from traditional crossover operators, since new genetic material is included in the offspring which is not contained in one of the parents. The evolutionary heuristic is tested on 35 publicly available BQP instances, and it is shown experimentally that the algorithm is capable of finding best-known solutions to large BQPs in a short time and with a high frequency. In comparison to other approaches for the BQP, the approach appears to be much more effective, particularly for large instances of 1000 or 2500 binary variables. [Copyright &y& Elsevier]

Recent studies of the quantum-mechanical processes in the DNA molecule have seriously challenged the principle that mutations occur randomly. The proton tunneling mechanism causes tautomeric transitions in base pairs resulting in mutations during DNA replication. The meticulous study of the quantum-mechanical phenomena in DNA may reveal that the process of mutagenesis is not completely random. We are still far away from a complete quantum-mechanical model of DNA sequence mutagenesis because of the complexity of the processes and the complex three-dimensional structure of the molecule. In this paper we have developed a quantum-mechanical description of DNA evolution and, following its outline, we have constructed a classical model for DNA evolution assuming that some aspects of the quantum-mechanical processes have influenced the determination of the genetic code. Conversely, our model assumes that the genetic code provides information about the quantum-mechanical mechanisms of mutagenesis, as the current code is the product of an evolutionary process that tries to minimize the spurious consequences of mutagenesis. Based on this model we develop an algorithm that can be used to study the accumulation of mutations in a DNA sequence. The algorithm has a user-friendly interface and the user can change key parameters in order to study relevant hypotheses. [Copyright &y& Elsevier]

This paper continues a theme of exploring algorithms based on principles of biological development for tasks such as pattern generation, machine learning and robot control. Previous work has investigated the use of genes expressed as fractal proteins to enable greater evolvability of gene regulatory networks (GRNs). Here, the evolution of such GRNs is investigated further to determine whether evolution exhibits natural tendencies towards efficiency and graceful degradation of developmental programs. Experiments where “perfect” GRNs are evolved for a further thousand generations without the addition of any further selection pressure, confirm this hypothesis. After further evolution, the perfect GRNs operate in a more efficient manner (using fewer proteins) and show an improved ability to function correctly with missing genes. When the algorithm is applied to applications (e.g. robot control) this equates to efficient and fault-tolerant controllers. [Copyright &y& Elsevier]

The shortest common superstring (SCS) problem, known to be NP-Complete, seeks the shortest string that contains all strings from a given set. In this paper we compare four approaches for finding solutions to the SCS problem: a standard genetic algorithm, a novel cooperative-coevolutionary algorithm, a benchmark greedy algorithm, and a parallel coevolutionary-greedy approach. We show the coevolutionary approach produces the best results, and discuss directions for future research. [Copyright &y& Elsevier]

Networks of interactions evolve in many different domains. They tend to have topological characteristics in common, possibly due to common factors in the way the networks grow and develop. It has been recently suggested that one such common characteristic is the presence of a hierarchically modular organization. In this paper, we describe a new algorithm for the detection and quantification of hierarchical modularity, and demonstrate that the yeast protein–protein interaction network does have a hierarchically modular organization. We further show that such organization is evident in artificial networks produced by computational evolution using a gene duplication operator, but not in those developing via preferential attachment of new nodes to highly connected existing nodes. [Copyright &y& Elsevier]

In this paper our main purpose is to give molecular solutions for the subset-sum problem. In order to achieve this, we propose a DNA-based algorithm of an n-bit parallel adder and a DNA-based algorithm of an n-bit parallel comparator to formally verify our designed molecular solutions for the subset-sum problem. [Copyright &y& Elsevier]

This paper presents an algorithm which is able to extract discriminant rules from oligopeptides for protease proteolytic cleavage activity prediction. The algorithm is developed using genetic programming. Three important components in the algorithm are a min-max scoring function, the reverse Polish notation (RPN) and the use of minimum description length. The min-max scoring function is developed using amino acid similarity matrices for measuring the similarity between an oligopeptide and a rule, which is a complex algebraic equation of amino acids rather than a simple pattern sequence. The Fisher ratio is then calculated on the scoring values using the class label associated with the oligopeptides. The discriminant ability of each rule can therefore be evaluated. The use of RPN makes the evolutionary operations simpler and therefore reduces the computational cost. To prevent overfitting, the concept of minimum description length is used to penalize over-complicated rules. A fitness function is therefore composed of the Fisher ratio and the use of minimum description length for an efficient evolutionary process. In the application to four protease datasets (Trypsin, Factor Xa, Hepatitis C Virus and HIV protease cleavage site prediction), our algorithm is superior to C5, a conventional method for deriving decision trees. [Copyright &y& Elsevier]

Multiple sequence alignment (MSA) is one of the basic problems in computational biology. Realistic problem instances of MSA are computationally intractable for exact algorithms. One way to tackle MSA is to use Hidden Markov Models (HMMs), which are known to be very powerful in the related problem domain of speech recognition. However, the training of HMMs is computationally hard and there is no known exact method that can guarantee optimal training within reasonable computing time. Perhaps the most powerful training method is the Baum–Welch algorithm, which is fast, but bears the problem of stagnation at local optima. In the study reported in this paper, we used a hybrid algorithm combining particle swarm optimization with evolutionary algorithms to train HMMs for the alignment of protein sequences. Our experiments show that our approach yields better alignments for a set of benchmark protein sequences than the most commonly applied HMM training methods, such as Baum–Welch and Simulated Annealing. [Copyright &y& Elsevier]

This paper presents fundamental distributed algorithms over membrane systems with antiport carriers. We describe distributed algorithms for collecting and dispersing information, leader election in these systems, and the mutual exclusion problem. Finally, we consider membrane systems producing correct results despite some failures at some of the components or the communication links. We show that membrane systems with antiport carriers provide an appropriate model for distributed computing, particularly for message-passing algorithms interpreted here as membrane transport in both directions, namely when two chemicals behave as input and output messages and pass the membranes in both directions using antiport carriers. [Copyright &y& Elsevier]

In this paper we introduce and apply the concept of local evolvability to investigate the behaviour of populations during evolutionary search. We focus on the evolution of GasNet neural network controllers for a robotic visual discrimination problem, showing that the evolutionary process undergoes long neutral fitness epochs. We show that the local evolvability properties of the search space surrounding a group of statistically neutral solutions do vary across the course of an evolutionary run, especially during periods of population takeover. However, once takeover is complete there is no evidence for further increase in local evolvability across fitness epochs. We also see no evidence for the neutral evolution of increased solution robustness, but show that this may be due to the ability of evolutionary algorithms to focus search on volumes of the fitness landscape with above average robustness. [Copyright &y& Elsevier]

The goal of the segmentation of brain images is to separate the images in different non-compatible homogenous areas reflecting the numerous anatomical structures. Brain segmentation by magnetic resonance has numerous implications for diagnosing brain disorganizations such as Alzheimer's, Parkinson-related syndrome among others. However, it is not an simple job to automatically segment the MR image. The main motive of this study is to provide a better segmentation approach for the segment of the ROI (Region Of Interest) region from the MRI image by solving the issues that currently exist in the literary works. MRI segmentation is not a trivial task, because acquired MR images are imperfect and are often corrupted by noise and other image artifacts. The variety in technologies for image processing has contributed to the creation in numerous image segmentation techniques. That is because there is no universal approach, nor are all methods necessarily appropriate for a specific form of picture suitable for all pictures. Other approaches still use the gray level histogram, for example, while others integrate detailed spatial picture details for bleeding conditions. Some methods use statistical techniques, but some do incorporate existing information to enhance segmentation efficiency. Some methods utilize probabilistic or fuzzy methods. Yet there are certain inconveniences of all the current processes. Therefore, we have intended to propose a new segmentation approach for the ROI region segmentation. The proposed work comprised of three phases namely preprocessing, edge detection and segmentation. At first, the MRI images are extracted from the database and that each of the input images is enhanced by applying a high pass filter. After completing the preprocessing method, the enhanced canny edge detection (ECED) approach is used to enhance the image. After that, the images are given to the modified watershed segmentation (MWS) algorithm which separates the ROI part from MRI Image. The testing consequences demonstrate that the proposed system accomplishes to give the good result related to the available strategies. Xilinx Virtex-5 FPGA is used to implement in this paper. [ABSTRACT FROM AUTHOR]

The conventional image segmentation techniques have a lot of issues with highest computational cost and low level accuracy for medical image diagnosis and genome analysis. The deep learning based optimization models utilize to predict the liver cancer with RNA genome using CT images and the prediction of genome classification with NGS is a higher probable in recent medical disease classification. This paper proposes a hybrid deep learning technique constructs with SegNet, MultiResUNet, and Krill Herd optimization (KHO) algorithm to perform the extraction of the liver lesions and RNA sequencing that the optimization techniques used into the deep learning method. The proposed technique implements the SegNet for segregating the liver with genome from the CT scan; the MultiResUNet is constructed to perform the extractions of liver lesions. The KHO algorithm is combined with the deep learning approaches for tuning the hyper parameters to every Convolutional neural network model and enhances the segmentation process which may elaborately identifies the sequence that causes the liver classification disease. The proposed technique is compared with the related techniques on liver lesion classification (LL) for NGS in genome. The performance results show that the proposed technique is better to other algorithms on various performance metrics. [ABSTRACT FROM AUTHOR]

DNA computing, as one of potential means to solve complicated computational problems, is a new field of interdisciplinary research, including computational mathematics, parallel algorithms, bioinformatics. Capacitated vehicle routing problem is one of famous NP-hard problems, which includes determining the path of a group same vehicles serving a set of clients, while minimizing the total transportation cost. Based on the bio-heuristic computing model and DNA molecular manipulations, parallel biocomputing algorithms for solving capacitated vehicle routing problem are proposed in this paper. We appropriately use different biological chains to mean vertices, edges, weights, and adopt appropriate biological operations to search the solutions of the problem with O (n 2) time complexity. We enrich the application scope of biocomputing, reduce computational complexity, and verify practicability of DNA parallel algorithms through simulations. [ABSTRACT FROM AUTHOR]