Next Article in Journal
Solutions of the Generalized Abel’s Integral Equations of the Second Kind with Variable Coefficients
Next Article in Special Issue
Genetic Algorithm for Scheduling Optimization Considering Heterogeneous Containers: A Real-World Case Study
Previous Article in Journal
A Fast Multilevel Fuzzy Transform Image Compression Method
Previous Article in Special Issue
A Study Concerning Soft Computing Approaches for Stock Price Forecasting
Open AccessArticle

GRSA Enhanced for Protein Folding Problem in the Case of Peptides

División de estudios de posgrado e investigación, Tecnológico Nacional de México, Instituto Tecnológico de Ciudad Madero, Madero 89440, Mexico
Dirección de Informática, Electrónica y Telecomunicaciones, Universidad Politécnica del Estado de Morelos, Boulevard Cuauhnáhuac 566, Jiutepec 62574, Mexico
Author to whom correspondence should be addressed.
Axioms 2019, 8(4), 136;
Received: 19 September 2019 / Revised: 13 November 2019 / Accepted: 28 November 2019 / Published: 4 December 2019
(This article belongs to the Special Issue Softcomputing: Theories and Applications)
Protein folding problem (PFP) consists of determining the functional three-dimensional structure of a target protein. PFP is an optimization problem where the objective is to find the structure with the lowest Gibbs free energy. It is significant to solve PFP for use in medical and pharmaceutical applications. Hybrid simulated annealing algorithms (HSA) use a kind of simulated annealing or Monte Carlo method, and they are among the most efficient for PFP. The instances of PFP can be classified as follows: (a) Proteins with a large number of amino acids and (b) peptides with a small number of amino acids. Several HSA have been positively applied for the first case, where I-Tasser has been one of the most successful in the CASP competition. PEP-FOLD3 and golden ratio simulated annealing (GRSA) are also two of these algorithms successfully applied to peptides. This paper presents an enhanced golden simulated annealing (GRSA2) where soft perturbations (collision operators), named “on-wall ineffective collision” and “intermolecular ineffective collision”, are applied to generate new solutions in the metropolis cycle. GRSA2 is tested with a dataset for peptides previously proposed, and a comparison with PEP-FOLD3 and I-Tasser is presented. According to the experimentation, GRSA2 has an equivalent performance to those algorithms. View Full-Text
Keywords: simulated annealing; hybrid simulated annealing; protein folding problem; peptides simulated annealing; hybrid simulated annealing; protein folding problem; peptides
Show Figures

Figure 1

MDPI and ACS Style

Frausto-Solís, J.; Sánchez-Hernández, J.P.; Maldonado-Nava, F.G.; González-Barbosa, J.J. GRSA Enhanced for Protein Folding Problem in the Case of Peptides. Axioms 2019, 8, 136.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

Search more from Scilit
Back to TopTop