2015
DOI: 10.7763/ijmlc.2015.v5.529
|View full text |Cite
|
Sign up to set email alerts
|

Modified Off-lattice AB Model for Protein Folding Problem Using the Vortex Search Algorithm

Abstract: Abstract-The energy function of the off-lattice AB model has a number of deep valleys and hills which usually leads the search algorithms to trap into a local minimum point. Existing studies usually performs algorithmic improvements on the well-known search methods to avoid from these local minimum points. However, these algorithmic improvements further increase the computational time which is not desired for the protein folding problem. In this study, it is aimed to smooth the energy landscape of this energy… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(4 citation statements)
references
References 10 publications
0
4
0
Order By: Relevance
“…The Vortex search algorithm is first proposed in [23,24]. Let us consider a two-dimensional optimization problem.…”
Section: Vortex Search Algorithm and Its Application For Designing Hymentioning
confidence: 99%
See 1 more Smart Citation
“…The Vortex search algorithm is first proposed in [23,24]. Let us consider a two-dimensional optimization problem.…”
Section: Vortex Search Algorithm and Its Application For Designing Hymentioning
confidence: 99%
“…To overcome this disadvantage, in this paper, the Routh's stability standard is used to check the stable condition of the HAPF system. The Vortex search is a new optimization algorithm, that is effecty in solving global optimization [23,24]. Then a new multi-objective optimization design, based on the Vortex Search (VS) algorithm is proposed to determine the best set of parameters for the HAPF.…”
Section: Introductionmentioning
confidence: 99%
“…Because of the simplicity of the proposed VS algorithm, a significant decrease in the computational time of the 50 benchmark numerical functions was also achieved when compared to the population-based algorithms. In some other studies [17][18][19][20], the VS algorithm has also been successfully used for the solution of some real-world optimization problems.…”
Section: Introductionmentioning
confidence: 99%
“…For this purpose, the solutions that exceed the boundaries are transferred into the boundaries [14]. In the selection part, s i in the each iteration compares with global best solution (sbest).…”
Section: International Journal Of Computer and Communication Engineeringmentioning
confidence: 99%