Journal
NEUROCOMPUTING
Volume 73, Issue 13-15, Pages 2308-2316Publisher
ELSEVIER
DOI: 10.1016/j.neucom.2010.02.021
Keywords
Depth-first search; Protein structure prediction; Genetic algorithm; HP lattice; HCP model
Categories
Funding
- Australian Research Council [DP0557303]
- Australian Research Council [DP0557303] Funding Source: Australian Research Council
Ask authors/readers for more resources
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 walks). Although a crossover-based converging conformation suffers from limited pathways, combining it with depth-first search (DFS) can partially reveal potential pathways and make an invalid crossover valid and successful. Random conformations are frequently applied for maintaining diversity as well as for initialization in many GA applications. The random-move-only-based conformation generator has exponential time complexity in generating random conformations, whereas the DFS-based random conformation generator has linear time complexity and performs relatively faster. We have performed extensive experiments using popular 2D, as well as useful 3D, models to justify our hypothesis empirically. (C) 2010 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available