2010
DOI: 10.1016/j.neucom.2010.02.021
|View full text |Cite
|
Sign up to set email alerts
|

DFS-generated pathways in GA crossover for protein structure prediction

Abstract: Genetic Algorithms (GAs), as nondeterministic conformational search techniques, are promising for solving protein structure prediction (PSP) problems. The crossover operator of a GA can underpin the formation of potential conformations by exchanging and sharing potential sub-conformations. However, as the optimum PSP conformation is usually compact, the crossover operation may result in many invalid conformations (by having non-self-avoiding-walk). Although a crossover-based converging conformation suffers fro… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
12
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
5
1
1
1

Relationship

3
5

Authors

Journals

citations
Cited by 19 publications
(12 citation statements)
references
References 67 publications
0
12
0
Order By: Relevance
“…An initial population was generated randomly and initialized an n -1 dimensional space within a fixed range. This study applied the method of the random conformation generation by Depth-first search (Hoque et al, 2010) to produce the initial population.…”
Section: Initializationmentioning
confidence: 99%
“…An initial population was generated randomly and initialized an n -1 dimensional space within a fixed range. This study applied the method of the random conformation generation by Depth-first search (Hoque et al, 2010) to produce the initial population.…”
Section: Initializationmentioning
confidence: 99%
“…They used Depth First Search (DFS) to generate pathways [31] in GA crossover for PSP. They also introduced a twin-removal operator [32] to remove duplicates from the population and thus to prevent the search from stalling.…”
Section: Introductionmentioning
confidence: 99%
“…It 344 contains a population of chromosomes where each chromosome represents a possible solution to the 345 problem under consideration. In general, a GA operates by initializing the population randomly, and by 346 iteratively updating the population through various operators including elitism, crossover, and mutation to 347 discover, prioritize and recombine good building blocks present in parent chromosomes to finally obtain 348 fitter chromosome (Hoque, et al, 2010;Hoque, et al, 2007;Hoque and Iqbal, 2017). scale_pos_weight, tree_method, and max_bin were set to 6, 0.1, 1, 'multi:softprob', 2, 100, 5, 0.9, 3, 'hist' 359 and 500, respectively and the rest of the parameters were set to their default value.…”
mentioning
confidence: 99%