Abstract
We examine the problem of packing secondary structure fragments into low energy conformations via a local search optimization algorithm. We first describe a simplified off-lattice model for the representation of protein conformations and adapt the energy minimization problem behind protein folding into our model. We propose a move set that transforms a protein conformation into another in order to enable the use of local search algorithms for protein folding simulations and conformational search. Special care has been taken so that amino acids in a conformation do not overlap. The constraint of producing an overlap-free conformation can be seen as a objective that conflicts with the energy minimization. Therefore, we approach protein folding as a two-objective problem. We employ a monte carlo-based optimization algorithm in combination to the proposed move set. The algorithm deals with the energy minimization problem while maintaining overlap-free conformations. Initial conformations incorporate experimentally determined secondary structure, which is preserved throughout the execution of local search. Our method produced conformations with a minimum RMSD of alpha-carbon atoms in the range of 3.95Å to 5.96Å for all benchmarks apart from one for which the value was 7.8Å.
Research partially supported by EPSRC Grant No. EP/D062012/1.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Berrera, M., Molinari, H., Fogolari, F.: Amino acid empirical contact energy definitions for fold recognition in the space of contact maps. BMC Bioinformatics 4(1), 8 (2003)
Dal Palù, A., Dovier, A., Fogolari, F.: Constraint logic programming approach to protein structure prediction. BMC Bioinformatics 5, 186 (2004)
Hoang, T.X., Seno, F., Banavar, J.R., et al.: Assembly of protein tertiary structures from secondary structures using optimized potentials. Proteins: Structure, Function, and Genetics 52(2), 155–165 (2003)
Maupetit, J., Gautier, R., Tuffery, P.: SABBAC: online Structural Alphabet-based protein BackBone reconstruction from Alpha-Carbon trace. Nucl. Acids Res. 34(2), W147–W151 (2006)
Miyazawa, S., Jernigan, R.L.: Residue - residue potentials with a favorable contact pair term and an unfavorable high packing density term, for simulation and threading. Journal of Molecular Biology 256(3), 623–644 (1996)
Xu, J., Berger, B.: Fast and accurate algorithms for protein side-chain packing. J. ACM 53(4), 533–557 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kapsokalivas, L. (2010). Stochastic Local Search for the Optimization of Secondary Structure Packing in Proteins. In: Blum, C., Battiti, R. (eds) Learning and Intelligent Optimization. LION 2010. Lecture Notes in Computer Science, vol 6073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13800-3_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-13800-3_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13799-0
Online ISBN: 978-3-642-13800-3
eBook Packages: Computer ScienceComputer Science (R0)