The genetic blueprint for the essential functions of life is encoded in DNA, which is translated into proteins-the engines driving most of our metabolic processes. Recent advancements in genome sequencing have unveiled a vast diversity of protein families, but compared with the massive search space of all possible amino acid sequences, the set of known functional families is minimal. One could say nature has a limited protein \"vocabulary.\" A major question for computational biologists, therefore, is whether this vocabulary can be expanded to include useful proteins that went extinct long ago or have never evolved (yet). By merging evolutionary algorithms, machine learning, and bioinformatics, we can develop highly customized \"designer proteins.\" We dub the new subfield of computational evolution, which employs evolutionary algorithms with DNA string representations, biologically accurate molecular evolution, and bioinformatics-informed fitness functions, Evolutionary Algorithms Simulating Molecular Evolution.

Building on and extending existing definitions of robustness and evolvability, we propose and utilize new formal definitions, with matching measures, of robustness and evolvability of systems with genotypes and corresponding phenotypes. We explain and show how these measures are more general and more representative of the concepts they stand for, than the commonly used/referenced measures originally proposed by Wagner. Further, a versatile digital modeling approach (BNK) is proposed that is inspired by NK systems. However, unlike NK systems, BNK incorporates a genotype and a phenotype, in addition to fitness. We develop and apply an Evolutionary Algorithm to a BNK-modeled system to find different types of perfect oscillators. We then map the resulting oscillating systems to possible genetic circuit realizations. Continuing with the synthetic biology theme, we also investigate the effect of noise in DNA synthesis on the predicted functionality of a DNA-based biosensor (i.e., its robustness), and we carry out a theoretical assessment of the evolvability of different types of ribozymes, undergoing directed evolution.

Without a well-defined energy management plan, achieving meaningful improvements in human lifestyle becomes challenging. Adequate energy resources are essential for development, but they are both limited and costly. In the literature, several solutions have been proposed for energy management but they either minimize energy consumption or improve the occupant\'s comfort index. The energy management problem is a multi-objective problem where the user wants to reduce energy consumption while keeping the occupant\'s comfort index intact. To address the multi-objective problem this paper proposed an energy control system for a green environment called PMC (Power Management and Control). The system is based on hybrid energy optimization, energy prediction, and multi-preprocessing. The combination of GA (Genetic Algorithm) and PSO (Particle Swarm Optimization) is performed to make a fusion methodology to improve the occupant comfort index (OCI) and decrease energy utilization. The proposed framework gives a better OCI when compared with its counterparts, the Ant Bee Colony Knowledge Base framework (ABCKB), GA-based prediction framework (GAP), Hybrid Prediction with Single Optimization framework (SOHP), and PSO-based power consumption framework. Compared with the existing AEO framework, the PMC gives practically the same OCI but consumes less energy. The PMC framework additionally accomplished the ideal OCI (i-e 1) when compared with the existing model, FA-GA (i-e 0.98). The PMC model consumed less energy as compared to existing models such as the ABCKB, GAP, PSO, and AEO. The PMC model consumed a little bit more energy than the SOHP but provided a better OCI. The comparative outcomes show the capability of the PMC framework to reduce energy utilization and improve the OCI. Unlike other existing methodologies except for the AEO framework, the PMC technique is additionally confirmed through a simulation by controlling the indoor environment using actuators, such as fan, light, AC, and boiler.

In this paper, genomics and precision medicine have witnessed remarkable progress with the advent of high-throughput sequencing technologies and advances in data analytics. However, because of the data\'s great dimensionality and complexity, the processing and interpretation of large-scale genomic data present major challenges. In order to overcome these difficulties, this research suggests a novel Intelligent Mutation-Based Evolutionary Optimization Algorithm (IMBOA) created particularly for applications in genomics and precision medicine. In the proposed IMBOA, the mutation operator is guided by genome-based information, allowing for the introduction of variants in candidate solutions that are consistent with known biological processes. The algorithm\'s combination of Differential Evolution with this intelligent mutation mechanism enables effective exploration and exploitation of the solution space. Applying a domain-specific fitness function, the system evaluates potential solutions for each generation based on genomic correctness and fitness. The fitness function directs the search toward ideal solutions that achieve the problem\'s objectives, while the genome accuracy measure assures that the solutions have physiologically relevant genomic properties. This work demonstrates extensive tests on diverse genomics datasets, including genotype-phenotype association studies and predictive modeling tasks in precision medicine, to verify the accuracy of the proposed approach. The results demonstrate that, in terms of precision, convergence rate, mean error, standard deviation, prediction, and fitness cost of physiologically important genomic biomarkers, the IMBOA consistently outperforms other cutting-edge optimization methods.

A bug tracking system (BTS) is a comprehensive data source for data-driven decision-making. Its various bug attributes can identify a BTS with ease. It results in unlabeled, fuzzy, and noisy bug reporting because some of these parameters, including severity and priority, are subjective and are instead chosen by the user\'s or developer\'s intuition rather than by adhering to a formal framework. This article proposes a hybrid, multi-criteria fuzzy-based, and multi-objective evolutionary algorithm to automate the bug management approach. The proposed approach, in a novel way, addresses the trade-offs of supporting multi-criteria decision-making to (a) gather decisive and explicit knowledge about bug reports, the developer\'s current workload and bug priority, (b) build metrics for computing the developer\'s capability score using expertise, performance, and availability (c) build metrics for relative bug importance score. Results of the experiment on five open-source projects (Mozilla, Eclipse, Net Beans, Jira, and Free desktop) demonstrate that with the proposed approach, roughly 20% of improvement can be achieved over existing approaches with the harmonic mean of precision, recall, f-measure, and accuracy of 92.05%, 89.04%, 90.05%, and 91.25%, respectively. The maximization of the throughput of the bug can be achieved effectively with the lowest cost when the number of developers or the number of bugs changes. The proposed solution addresses the following three goals: (i) improve triage accuracy for bug reports, (ii) differentiate between active and inactive developers, and (iii) identify the availability of developers according to their current workload.

Feature selection (FS) is a critical step in many data science-based applications, especially in text classification, as it includes selecting relevant and important features from an original feature set. This process can improve learning accuracy, streamline learning duration, and simplify outcomes. In text classification, there are often many excessive and unrelated features that impact performance of the applied classifiers, and various techniques have been suggested to tackle this problem, categorized as traditional techniques and meta-heuristic (MH) techniques. In order to discover the optimal subset of features, FS processes require a search strategy, and MH techniques use various strategies to strike a balance between exploration and exploitation. The goal of this research article is to systematically analyze the MH techniques used for FS between 2015 and 2022, focusing on 108 primary studies from three different databases such as Scopus, Science Direct, and Google Scholar to identify the techniques used, as well as their strengths and weaknesses. The findings indicate that MH techniques are efficient and outperform traditional techniques, with the potential for further exploration of MH techniques such as Ringed Seal Search (RSS) to improve FS in several applications.

This study introduces and evaluates the PHAST+ model, part of a computational framework designed to simulate the behavior of auditory nerve fibers in response to the electrical stimulation from a cochlear implant. PHAST+ incorporates a highly efficient method for calculating accommodation and adaptation, making it particularly suited for simulations over extended stimulus durations. The proposed method uses a leaky integrator inspired by classic biophysical nerve models. Through evaluation against single-fiber animal data, our findings demonstrate the model\'s effectiveness across various stimuli, including short pulse trains with variable amplitudes and rates. Notably, the PHAST+ model performs better than its predecessor, PHAST (a phenomenological model by van Gendt et al.), particularly in simulations of prolonged neural responses. While PHAST+ is optimized primarily on spike rate decay, it shows good behavior on several other neural measures, such as vector strength and degree of adaptation. The future implications of this research are promising. PHAST+ drastically reduces the computational burden to allow the real-time simulation of neural behavior over extended periods, opening the door to future simulations of psychophysical experiments and multi-electrode stimuli for evaluating novel speech-coding strategies for cochlear implants.

Biohybrid machines (BHMs) are an amalgam of actuators composed of living cells with synthetic materials. They are engineered in order to improve autonomy, adaptability and energy efficiency beyond what conventional robots can offer. However, designing these machines is no trivial task for humans, provided the field\'s short history and, thus, the limited experience and expertise on designing and controlling similar entities, such as soft robots. To unveil the advantages of BHMs, we propose to overcome the hindrances of their design process by developing a modular modeling and simulation framework for the digital design of BHMs that incorporates Artificial Intelligence powered algorithms. Here, we present the initial workings of the first module in an exemplar framework, namely, an evolutionary morphology generator. As proof-of-principle for this project, we use the scenario of developing a biohybrid catheter as a medical device capable of arriving to hard-to-reach regions of the human body to release drugs. We study the automatically generated morphology of actuators that will enable the functionality of that catheter. The primary results presented here enforced the update of the methodology used, in order to better depict the problem under study, while also provided insights for the future versions of the software module.

Computer-aided drug design has advanced rapidly in recent years, and multiple instances of in silico designed molecules advancing to the clinic have demonstrated the contribution of this field to medicine. Properly designed and implemented platforms can drastically reduce drug development timelines and costs. While such efforts were initially focused primarily on target affinity/activity, it is now appreciated that other parameters are equally important in the successful development of a drug and its progression to the clinic, including pharmacokinetic properties as well as absorption, distribution, metabolic, excretion and toxicological (ADMET) properties. In the last decade, several programs have been developed that incorporate these properties into the drug design and optimization process and to varying degrees, allowing for multi-parameter optimization. Here, we introduce the Artificial Intelligence-driven Drug Design (AIDD) platform, which automates the drug design process by integrating high-throughput physiologically-based pharmacokinetic simulations (powered by GastroPlus) and ADMET predictions (powered by ADMET Predictor) with an advanced evolutionary algorithm that is quite different than current generative models. AIDD uses these and other estimates in iteratively performing multi-objective optimizations to produce novel molecules that are active and lead-like. Here we describe the AIDD workflow and details of the methodologies involved therein. We use a dataset of triazolopyrimidine inhibitors of the dihydroorotate dehydrogenase from Plasmodium falciparum to illustrate how AIDD generates novel sets of molecules.

Alignment of each optical element at a synchrotron beamline takes days, even weeks, for each experiment costing valuable beam time. Evolutionary algorithms (EAs), efficient heuristic search methods based on Darwinian evolution, can be utilized for multi-objective optimization problems in different application areas. In this study, the flux and spot size of a synchrotron beam are optimized for two different experimental setups including optical elements such as lenses and mirrors. Calculations were carried out with the X-ray Tracer beamline simulator using swarm intelligence (SI) algorithms and for comparison the same setups were optimized with EAs. The EAs and SI algorithms used in this study for two different experimental setups are the Genetic Algorithm (GA), Non-dominated Sorting Genetic Algorithm II (NSGA-II), Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC). While one of the algorithms optimizes the lens position, the other focuses on optimizing the focal distances of Kirkpatrick-Baez mirrors. First, mono-objective evolutionary algorithms were used and the spot size or flux values checked separately. After comparison of mono-objective algorithms, the multi-objective evolutionary algorithm NSGA-II was run for both objectives - minimum spot size and maximum flux. Every algorithm configuration was run several times for Monte Carlo simulations since these processes generate random solutions and the simulator also produces solutions that are stochastic. The results show that the PSO algorithm gives the best values over all setups.