Pareto Dominance Archive and Coordinated Selection Strategy-Based Many-Objective Optimizer for Protein Structure Prediction
Protein structure prediction (PSP) is predicting the three-dimensional of protein from its amino acid sequence only based on the information hidden in the protein sequence. One of the efficient tools to describe this information is protein energy functions. Despite the advancements in biology and computer science, PSP is still a challenging problem due to its large protein conformation space and inaccurate energy functions. In this study, PSP is treated as a many-objective optimization problem and four conflicting energy functions are used as different objectives to be optimized. A novel Pareto-dominance-archive and Coordinated-selection-strategy-based Many-objective-optimizer (PCM) is proposed to perform the conformation search. In it, convergence and diversity-based selection metrics are used to enable PCM to find near-native proteins with well-distributed energy values, while a Pareto-dominance-based archive is proposed to save more potential conformations that can guide the search to more promising conformation areas. The experimental results on thirty-four benchmark proteins demonstrate the significant superiority of PCM in comparison with other single, multiple, and many-objective evolutionary algorithms. Additionally, the inherent characteristics of iterative search of PCM can also give more insights into the dynamic progress of protein folding besides the final predicted static tertiary structure. All these confirm that PCM is a fast, easy-to-use, and fruitful solution generation method for PSP.
Code (1)
Tasks
Evolutionary AlgorithmsProtein FoldingProtein Structure PredictionSimilar Papers 제목 키워드 기반
A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
This paper presents a first mathematical runtime analysis of PAES-25, an enhanced version of the original Pareto Archived Evolution Strategy (PAES) coming from the study of telecommunication problems over two decades ago…
Center-Outward q-Dominance: A Sample-Computable Proxy for Strong Stochastic Dominance in Multi-Objective Optimisation
Stochastic multi-objective optimization (SMOOP) requires ranking multivariate distributions; yet, most empirical studies perform scalarization, which loses information and is unreliable. Based on the optimal transport th…
A Grid-Based Evolutionary Algorithm for Many-Objective Optimization
Balancing convergence and diversity plays a key role in evolutionary multiobjective optimization (EMO). Most current EMO algorithms perform well on problems with two or three objectives, but encounter difficulties in the…
DiversityMultiobjective OptimizationCoevolutionary Framework for Generalized Multimodal Multi-objective Optimization
Most multimodal multi-objective evolutionary algorithms (MMEAs) aim to find all global Pareto optimal sets (PSs) for a multimodal multi-objective optimization problem (MMOP). However, in real-world problems, decision mak…
DiversityEvolutionary AlgorithmsTransfer LearningA metaheuristic multi-objective interaction-aware feature selection method
Multi-objective feature selection is one of the most significant issues in the field of pattern recognition. It is challenging because it maximizes the classification performance and, at the same time, minimizes the numb…
feature selectionMetaheuristic Optimization