Abstract
Protein Structure Prediction (PSP) is a challenging optimization problem in computational biology. A large number of non-deterministic approaches such as Evolutionary Algorithms (EAs) have been have been effectively applied to a variety of fields though, in the rugged landscape of multimodal problem like PSP, it can perform unsatisfactorily, due to premature convergence. In EAs, selection plays a significant role to avoid getting trapped in local optima and also to guide the evolution towards an optimal solution. In this paper, we propose a new Sib-based survival selection strategy suitable for application in a genetic algorithm (GA) to deal with multimodal problems. The proposed strategy, inspired by the concept of crowding method, controls the flow of genetic material by pairing off the fittest offspring amongst all the sibs (offspring inheriting most of the genetic material from an ancestor) with its ancestor for survival. Furthermore, by selecting the survivors in a hybridized manner of deterministic and probabilistic selection, the method allows the exploitation of less fit solutions along with the fitter ones and thus facilitates escaping from local optima (minima in case of PSP). Experiments conducted on a set of widely used benchmark sequences for 3D-FCC HP lattice model, demonstrate the potential of the proposed method, both in terms of diversity and optimal energy in regard to various state-of-the-art selection methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ursem, R.K.: Models for evolutionary algorithms and their applications in system identification and control optimization. In: BRICS (2003)
De Jong, K.A.: Evolutionary computation: a unified approach. MIT Press (2006)
Ooi, C., Chetty, M., Teng, S.: Differential prioritization in feature selection and classifier aggregation for multiclass microarray datasets. Data Mining and Knowledge Discovery 14(3), 329–366 (2007)
Lau, K., Dill, K.A.: A lattice statistical mechanics model of the conformational and sequence spaces of proteins. Macromolecules 22(10), 3986–3997 (1989)
Islam, M.K., Chetty, M.: Clustered memetic algorithm with local heuristics for ab initio protein structure prediction. IEEE Trans. Evolutionary Computation 17(4), 558–576 (2013)
Blickle, T., Thiele, L.: A comparison of selection schemes used in genetic algorithms (1995)
Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. In: FOGA, pp. 69–93. Morgan Kaufmann (1991)
Mengshoel, O.J., Galan, S.F.: Generalized crowding for genetic algorithms. In: Genetic and Evolutionary Computation Conference 2010 (GECCO 2010), pp. 775–782 (2010)
Mahfoud, S.W.: Niching methods for genetic algorithms. Urbana, 51(95001) (1995)
Mengshoel, O.J., Goldberg, D.E.: Probabilistic crowding: Deterministic crowding with probabilistic replacement. In: Proc. of the Genetic and Evolutionary Computation Conference (GECCO 1999), pp. 409–416 (1999)
Nazmul, R., Chetty, M.: An adaptive strategy for assortative mating in genetic algorithm. In: IEEE Conference on Evolutionary Computation, June 20-23, pp. 2237–2244 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Nazmul, R., Chetty, M. (2014). Sib-Based Survival Selection Technique for Protein Structure Prediction in 3D-FCC Lattice Model. In: Loo, C.K., Yap, K.S., Wong, K.W., Teoh, A., Huang, K. (eds) Neural Information Processing. ICONIP 2014. Lecture Notes in Computer Science, vol 8835. Springer, Cham. https://doi.org/10.1007/978-3-319-12640-1_57
Download citation
DOI: https://doi.org/10.1007/978-3-319-12640-1_57
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12639-5
Online ISBN: 978-3-319-12640-1
eBook Packages: Computer ScienceComputer Science (R0)