Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Software note: Use of a novel Hill-climbing genetic algorithm in protein folding simulations
Computational Biology and Chemistry
Multiobjective immune algorithm with nondominated neighbor-based selection
Evolutionary Computation
Overview of artificial immune systems for multi-objective optimization
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
A multiobjective simultaneous learning framework for clustering and classification
IEEE Transactions on Neural Networks
Artificial immune multi-objective SAR image segmentation with fused complementary features
Information Sciences: an International Journal
Clonal selection algorithms: a comparative case study using effective mutation potentials
ICARIS'05 Proceedings of the 4th international conference on Artificial Immune Systems
Multi-objective immune algorithm with Baldwinian learning
Applied Soft Computing
Clustering-Based multi-objective immune optimization evolutionary algorithm
ICARIS'12 Proceedings of the 11th international conference on Artificial Immune Systems
Off-lattice protein structure prediction with homologous crossover
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Population-based harmony search using GPU applied to protein structure prediction
International Journal of Computational Science and Engineering
Hi-index | 0.00 |
In this work we investigate the applicability of a multiobjective formulation of the Ab-Initio Protein Structure Prediction (PSP) to medium size protein sequences (46-70 residues). In particular, we introduce a modified version of Pareto Archived Evolution Strategy (PAES) which makes use of immune inspired computing principles and which we will denote by “I-PAES”. Experimental results on the test bed of five proteins from PDB show that PAES, (1+1)-PAES and its modified version I-PAES, are optimal multiobjective optimization algorithms and the introduced mutation operators, mut1 and mut2, are effective for the PSP problem. The proposed I-PAES is comparable with other evolutionary algorithms proposed in literature, both in terms of best solution found and computational cost.