Abstract
This work explores different evolutionary approaches to Protein Structure Prediction (PSP), a highly constrained problem. These are the utilization of a repair procedure, and the use of evolutionary operators whose functioning is closed in feasible space. Both approaches rely on hybridizing the evolutionary algorithm (EA) with a backtracking algorithm. The so-obtained hybrid EAs are described, and empirically compared to a penalty-based EA. The utilization of the repair procedure reveals itself as a very appropriate technique for tackling this problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
B. Berger and T. Leight. Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete. Journal of Computational Biology, 5(2):27–40, 1998.
K.A. Dill. Dominat forces in protein folding. Biochemistry, 29:7133–7155, 1990.
D. Hinds and M. Levitt. A lattice model for protein structure prediction at low resolution. Proceedings of the National Academy of Sciences, 89:2536–2540, 1992.
M. Khimasia and P. Coveney. Protein structure prediction as a hard optimization problem: the genetic algorithm approach. Molecular Simulation, 19:205–226, 1997.
N. Krasnogor, W.E. Hart, J. Smith, and D.A. Pelta. Protein structure prediction with evolutionary algorithms. In W. Banzhaf et al., editors, Proceedings of the GECCO’99, pages 1596–1601, San Mateo CA, 1999. Morgan Kaufmann.
N. Krasnogor, D.A. Pelta, P.M. López, P. Mocciola, and D. de la Canal. Genetic algorithms for the protein folding problem: A critical view. In E. Alpaydin, editor, Proceedings of the EIS’98. ICSC Academic Press, 1998.
A.L. Patton, W.F. Punch III, and E.D. Goodman. A standard GA approach to native protein conformation prediction. In L.J. Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 574–581, San Mateo CA, 1995. Morgan Kaufmann.
A. Piccolboni and G. Mauri. Application of evolutionary algorithms to protein folding prediction. In Jin-Kao Hao et al., editors, Artificial Evolution III, volume 1363 of Lecture Notes in Computer Science, pages 123–136. Springer-Verlag, 1998.
G. Raghunathan and R.L. Jernigan. Ideal architecture of residue packing and its observation in protein structures. Protein Science, 6:2072–2083, 1997.
R. Unger and J. Moult. Genetic algorithms for protein folding simulations. Journal of Molecular Biology, 231(1):75–81, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cotta, C. (2003). Protein Structure Prediction Using Evolutionary Algorithms Hybridized with Backtracking. In: Mira, J., Álvarez, J.R. (eds) Artificial Neural Nets Problem Solving Methods. IWANN 2003. Lecture Notes in Computer Science, vol 2687. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44869-1_41
Download citation
DOI: https://doi.org/10.1007/3-540-44869-1_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40211-4
Online ISBN: 978-3-540-44869-3
eBook Packages: Springer Book Archive