A machine learning method based on the genetic and world competitive contests algorithms for selecting genes or features in biological applications

Deciphering anti-biofilm property of Arthrospira platensis-origin peptides against Staphylococcusaureus

Arthrospira platensis is a valuable natural health supplement consisting of various types of vitamins, dietary minerals, and antioxidants. Although different studies have been conducted to explore the hidden benefits of this bacterium, its antimicrobial property has been poorly understood. To decipher this important feature, here, we extended our recently introduced optimization algorithm (Trader) for aligning amino acid sequences associated with the antimicrobial peptides (AMPs) of Staphylococcus aureus and A.platensis. As a result, similar amino acid sequences were identified, and several candidate peptides were generated accordingly. The obtained peptides were then filtered based on their potential biochemical and biophysical properties, and their 3D structures were simulated based on homology modeling techniques. Next, to investigate how the generated peptides can interact with S. aureus proteins (i.e., heptameric state of the hly and homodimeric form of the arsB), molecular docking approaches were used. The results indicated that four peptides included better molecular interactions relative to the other generated ones in terms of the number/average length of hydrogen bonds and hydrophobic interactions. Based on the outcomes, it can be concluded that the antimicrobial property of A.platensis might be associated with its capability in disturbing the membrane of pathogens and their functions.

A voting-based machine learning approach for classifying biological and clinical datasets

BACKGROUND

Different machine learning techniques have been proposed to classify a wide range of biological/clinical data. Given the practicability of these approaches accordingly, various software packages have been also designed and developed. However, the existing methods suffer from several limitations such as overfitting on a specific dataset, ignoring the feature selection concept in the preprocessing step, and losing their performance on large-size datasets. To tackle the mentioned restrictions, in this study, we introduced a machine learning framework consisting of two main steps. First, our previously suggested optimization algorithm (Trader) was extended to select a near-optimal subset of features/genes. Second, a voting-based framework was proposed to classify the biological/clinical data with high accuracy. To evaluate the efficiency of the proposed method, it was applied to 13 biological/clinical datasets, and the outcomes were comprehensively compared with the prior methods.

RESULTS

The results demonstrated that the Trader algorithm could select a near-optimal subset of features with a significant level of p-value < 0.01 relative to the compared algorithms. Additionally, on the large-sie datasets, the proposed machine learning framework improved prior studies by ~ 10% in terms of the mean values associated with fivefold cross-validation of accuracy, precision, recall, specificity, and F-measure.

CONCLUSION

Based on the obtained results, it can be concluded that a proper configuration of efficient algorithms and methods can increase the prediction power of machine learning approaches and help researchers in designing practical diagnosis health care systems and offering effective treatment plans.

Risk Stratification for Breast Cancer Patient by Simultaneous Learning of Molecular Subtype and Survival Outcome Using Genetic Algorithm-Based Gene Set Selection

Simple Summary

Patient stratification is clinically important because it allows us to understand the characteristics and establish treatment strategies for a group. Transcriptomic data play an important role in determining molecular subtypes and predicting survival. In the case of breast cancer, although the order of prognosis according to molecular subtypes is well known, there is heterogeneity even within a subtype. Therefore, patient stratification considering both molecular subtypes and survival outcomes is required. In this study, a methodology to handle this problem is presented. A genetic algorithm is used to select a set of genes, and a risk score is assigned to each patient using their expression level. According to the risk score, patients are ordered and stratified considering molecular subtypes and survival outcomes. Consequently, informative genes for patient stratification with respect to both aspects could be nominated, and the usefulness of the risk score was shown through comparison with other indicators.

Abstract

Patient stratification is a clinically important task because it allows us to establish and develop efficient treatment strategies for particular groups of patients. Molecular subtypes have been successfully defined using transcriptomic profiles, and they are used effectively in clinical practice, e.g., PAM50 subtypes of breast cancer. Survival prediction contributed to understanding diseases and also identifying genes related to prognosis. It is desirable to stratify patients considering these two aspects simultaneously. However, there are no methods for patient stratification that consider molecular subtypes and survival outcomes at once. Here, we propose a methodology to deal with the problem. A genetic algorithm is used to select a gene set from transcriptome data, and their expression quantities are utilized to assign a risk score to each patient. The patients are ordered and stratified according to the score. A gene set was selected by our method on a breast cancer cohort (TCGA-BRCA), and we examined its clinical utility using an independent cohort (SCAN-B). In this experiment, our method was successful in stratifying patients with respect to both molecular subtype and survival outcome. We demonstrated that the orders of patients were consistent across repeated experiments, and prognostic genes were successfully nominated. Additionally, it was observed that the risk score can be used to evaluate the molecular aggressiveness of individual patients.

The state of art on the prediction of efficiency and modeling of the processes of pollutants removal based on machine learning

During the last few years, important advances have been made in big data exploration, complex pattern recognition and prediction of complex variables. Machine learning (ML) algorithms can efficiently analyze voluminous data, identify complex patterns and extract conclusions. In chemical engineering, the application of machine learning approaches has become highly attractive due to the growing complexity of this field. Machine learning allows computers to solve problems by learning from large data sets and provides researchers with an excellent opportunity to enhance the quality of predictions for the output variables of a chemical process. Its performance has been increasingly exploited to overcome a wide range of challenges in chemistry and chemical engineering, including improving computational chemistry, planning materials synthesis and modeling pollutant removal processes. In this review, we introduce this discipline in terms of its accessible to chemistry and highlight studies that illustrate in-depth the exploitation of machine learning. The main aim of the review paper is to answer these questions by analyzing physicochemical processes that exploit machine learning in organic and inorganic pollutants removal. In general, the purpose of this review is both to provide a summary of research related to the removal of various contaminants performed by ML models and to present future research needs in ML for contaminant removal.

Structure-based drug repurposing against COVID-19 and emerging infectious diseases: methods, resources and discoveries

To attain promising pharmacotherapies, researchers have applied drug repurposing (DR) techniques to discover the candidate medicines to combat the coronavirus disease 2019 (COVID-19) outbreak. Although many DR approaches have been introduced for treating different diseases, only structure-based DR (SBDR) methods can be employed as the first therapeutic option against the COVID-19 pandemic because they rely on the rudimentary information about the diseases such as the sequence of the severe acute respiratory syndrome coronavirus 2 genome. Hence, to try out new treatments for the disease, the first attempts have been made based on the SBDR methods which seem to be among the proper choices for discovering the potential medications against the emerging and re-emerging infectious diseases. Given the importance of SBDR approaches, in the present review, well-known SBDR methods are summarized, and their merits are investigated. Then, the databases and software applications, utilized for repurposing the drugs against COVID-19, are introduced. Besides, the identified drugs are categorized based on their targets. Finally, a comparison is made between the SBDR approaches and other DR methods, and some possible future directions are proposed.

A novel multi-objective metaheuristic algorithm for protein-peptide docking and benchmarking on the LEADS-PEP dataset

Protein-peptide interactions have attracted the attention of many drug discovery scientists due to their possible druggability features on most key biological activities such as regulating disease-related signaling pathways and enhancing the immune system's responses. Different studies have utilized some protein-peptide-specific docking algorithms/methods to predict protein-peptide interactions. However, the existing algorithms/methods suffer from two serious limitations which make them unsuitable for protein-peptide docking problems. First, it seems that the prevalent approaches require to be modified and remodeled for weighting the unbounded forces between a protein and a peptide. Second, they do not employ state-of-the-art search algorithms for detecting the 3D pose of a peptide relative to a protein. To address these restrictions, the present study aims to introduce a novel multi-objective algorithm, which first generates some potential 3D poses of a peptide, and then, improves them through its operators. The candidate solutions are further evaluated using Multi-Objective Pareto Front (MOPF) optimization concepts. To this end, van der Waals, electrostatic, solvation, and hydrogen bond energies between the atoms of a protein and designated peptide are computed. To evaluate the algorithm, it is first applied to the LEADS-PEP dataset containing 53 protein-peptide complexes with up to 53 rotatable branches/bonds and then compared with three popular/efficient algorithms. The obtained results indicate that the MOPF-based approaches which reduce the backbone RMSD between the original and predicted states, achieve significantly better results in terms of the success rate in predicting the near-native conditions. Besides, a comparison between the different types of search algorithms reveals that efficient ones like the multi-objective Trader/differential evolution algorithm can predict protein-peptide interactions better than the popular algorithms such as the multi-objective genetic/particle swarm optimization algorithms.