Summary
This paper describes a co-evolutionary learning-optimisation approach to Protein Structure Prediction which uses a Memetic Algorithm as its underlying search method. Instance-specific knowledge can be learned, stored and applied by the system in the form of a population of rules. These rules determine the neighbourhoods used by the local search process, which is applied to each member of the co-evolving population of candidate solutions.
A generic co-evolutionary framework is proposed for this approach, and the implementation of a simple Self-Adaptive instantiation is described. A rule defining the local search’s move operator is encoded as a {condition : action} pair and added to the genotype of each individual. It is demonstrated that the action of mutation and crossover on the patterns encoded in these rules, coupled with the action of selection on the resultant phenotypes is sufficient to permit the discovery and propagation of knowledge about the instance being optimised.
The algorithm is benchmarked against a simple Genetic Algorithm, a Memetic Algorithm using a fixed neighbourhood function, and a similar Memetic Algorithm which uses random (rather than evolved) rules and shows significant improvements in terms of the ability to locate optimum configurations using Dill’s HP model. It is shown that this “meta-learning” of problem features provides a means of creating highly scalable algorithms.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
., editor. 2003 Congress on Evolutionary Computation (CEC’2003). IEEE Press, Piscataway, NJ, 2003.
Thomas Bäck. Self adaptation in genetic algorithms. In F.J. Varela and P. Bourgine, editors, Toward a Practice of Autonomous Systems: Proceedings of the 1st European Conference on Artificial Life, pages 263–271. The MIT Press, Cambridge, MA, 1992.
W. Banzhaf, J. Daida, A.E. Eiben, M.H. Garzon, V. Honavar, M. Jakiela, and R.E. Smith, editors. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-1999). Morgan Kaufmann, 1999.
B. Berger and T. Leight. Protein folding in the hydrophobic-hydrophilic (hp) model is NP-complete. In Proc. 2nd Annual Intnl. Conf. Computational Molecular Biology RECOMB98, 1998.
Larry Bull. Artificial Symbiology. PhD thesis, University of the West of England, 1995.
Larry Bull. Evolutionary computing in multi agent environments: Partners. In Th. Bäck, editor, Proceedings of the 7th International Conference on Genetic Algorithms, pages 370–377. Morgan Kaufmann, San Francisco, 1997.
Lawrence Bull and Terence C. Fogarty. Horizontal gene transfer in endosymbiosis. In Christopher G. Langton and Katsunori Shimohara, editors, Proceedings of the 5th International Workshop on Artificial Life: Synthesis and Simulation of Living Systems (ALIFE-96), pages 77–84, Cambridge, May 16–18 1997. MIT Press.
K. Dill. Biochemistry, 24:1501, 1985.
S. Duarte-Flores and J.E. Smith. Study of fitness landscapes for the HP model of Protein Structure Prediction. In. [1], page to appear.
M. Feig, P. Rotkiewicz, A. Kolinski, J. Skolnick, and C. Brooks. Accurate reconstruction of all-atom protein representations from side-chain-based low-resolution models. Proteins Structure Fucntion and Genetics, 41:86–97, 2000.
David B. Fogel. Evolving Artificial Intelligence. PhD thesis, University if California, 1992.
J.J. Merelo Guervos, P. Adamidis, H.-G. Beyer, J.-L. Fernandez-Villacanas, and H.-P. Schwefel, editors. Proceedings of the 7th Conference on Parallel Problem Solving from Nature, number 2439 in Lecture Notes in Computer Science. Springer, Berlin, 2002.
P. Hansen and N. Mladenovic. An introduction to variable neighborhood search. In S. Voß, S. Martello, I. H. Osman, and C. Roucairol, editors, Meta-Heuristics: Advances and trends in local search paradigms for optimization. Proceedings of MIC 97 Conference. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998.
W. E. Hart. Adaptive Global Optimization with Local Search. PhD thesis, University of California, San Diego, 1994.
Terry Jones. Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, The University of New Mexico, Albuquerque, NM, 1995.
Hillol Kargupta and Samiran Ghosh. Towards machine learning through genetic code-like transformations. Technical Report TR-CS-01-10, Computer Science and Electrical Engineering Department, University of Maryland Baltimore County, 2001.
S.A. Kauffman. Origins of Order: Self-Organization and Selection in Evolution. Oxford University Press, New York, NY, 1993.
Robert E. Keller and Wolfgang Banzhaf. Genetic programming using genotypephenotype mapping from linear genomes into linear phenotypes. In J.R. Koza, D.E. Goldberg, D.B. Fogel, and R.L. Riolo, editors, Proceedings of the 1st Annual Conference on Genetic Programming, pages 116–122. MIT Press, 1996.
Robert E. Keller and Wolfgang Banzhaf. The evolution of genetic code in genetic programming. In J. Daida, A.E. Eiben, M.H. Garzon, V. Honavar, M. Jakiela, and R.E. Smith, editors. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-1999). Morgan Kaufmann, 1999 Banzhaf et al. [3], pages 1077–1082.
Joshua Knowles and David Corne. A comparative assessment of memetic, evolutionary and constructive algorithms for the multi-objective D-MSAT problem. In Gecco-2001 Workshop Program, pages 162–167, 2001.
A. Kolinski and J. Skolnick. Assembly of protein structure from sparse experimental data: An efficient Monte-Carlo method. Proteins: Structure Function and Genetics, 32:475–494, 1998.
N. Krasnogor and S. Gustafson. Toward truly “memetic” memetic algorithms: discussion and proofs of concept. In David Corne, Gary Fogel, William Hart, Joshua Knowles, Natalio Krasnogor, Rajkumar Roy, Jim Smith, and Ashutosh Tiwari, editors, Advances in Nature-Inspired Computation: The PPSN VII Workshops, pages 9–10, Reading, UK, 2002. PEDAL (Parallel, Emergent & Distributed Architectures Lab), University of Reading.
N. Krasnogor, W. Hart, J.E. Smith, and D. Pelta. Protein structure prediction with evolutionary algorithms. In J. Daida, A.E. Eiben, M.H. Garzon, V. Honavar, M. Jakiela, and R.E. Smith, editors. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-1999). Morgan Kaufmann, 1999 Banzhaf et al. [3], pages 1596–1601.
N. Krasnogor and J. Smith. A memetic algorithm with self-adaptive local search: TSP as a case study. In D. Whitley, D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, and H.-G. Beyer, editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), pages 987–994. Morgan Kaufmann, 2000.
Natalio Krasnogor. Studies in the Theory and Design Space of Memetic Algorithms. PhD thesis, University of the West of England, 2002.
Natalio Krasnogor and Jim Smith. Emergence of profitiable search strategies based on a simple inheritance mechanism. In L. Spector, E. Goodman, A. Wu, W.B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. Garzon, and E. Burke, editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 432–439. Morgan Kaufmann, 2001.
Peter Merz. Memetic Algorithms for Combinatorial Optimization Problems: Fitness Landscapes and Efective Search Strategies. PhD thesis, Department of Electrical Engineering and Computer Science, University of Siegen, Germany, 2000.
Peter Merz and Bernd Freisleben. Fitness landscapes and memetic algorithm design. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 245–260. McGraw Hill, 1999.
Pablo Moscato. Memetic algorithms’ home page. Technical report, http://www.densis.fee.unicamp.br/~moscato/memetic_home.html, 2002.
N. Krasnogor, B.P. Blackburne, E.K. Burke and J. D. Hirst. Multimeme algorithms for protein structure prediction. In P. Adamidis, H.-G. Beyer, J.-L. Fernandez-Villacanas, and H.-P. Schwefel, editors. Proceedings of the 7th Conference on Parallel Problem Solving from Nature, number 2439 in Lecture Notes in Computer Science. Springer, Berlin, 2002 Guervos et al. [12], pages 769–778.
Jan Paredis. The symbiotic evolution of solutions and their representations. In L.J. Eshelman, editor, Proceedings of the 6th International Conference on Genetic Algorithms, pages 359–365. Morgan Kaufmann, San Francisco, 1995.
Jan Paredis. Coevolutionary algorithms. In T. Bäck, D. Fogel, and Z. Michalewicz, editors, Handbook of Evolutionary Computation. Institute of Physics Publishing, Bristol, and Oxford University Press, New York, 1998.
M. A. Potter and K.A. DeJong. A cooperative coevolutionary approach to function optimisation. In Y. Davidor, H.-P. Schwefel, and R. Männer, editors, Proceedings of the 3rd Conference on Parallel Problem Solving from Nature, number 866 in Lecture Notes in Computer Science, pages 248–257. Springer, Berlin, 1994.
J.David Schaffer and Amy Morishima. An adaptive crossover distribution mechanism for genetic algorithms. In J.J. Grefenstette, editor, Proceedings of the 2nd International Conference on Genetic Algorithms and Their Applications, pages 36–40. Lawrence Erlbaum Associates, 1987.
H.-P. Schwefel. Numerical Optimisation of Computer Models. John Wiley and Sons, New York, 1981.
J.E. Smith. Co-evolving memetic algorithms: A learning approach to robust scalable optimisation. In. [1], page to appear.
Jim Smith. Co-evolution of memetic algorithms: Initial investigations. In P. Adamidis, H.-G. Beyer, J.-L. Fernandez-Villacanas, and H.-P. Schwefel, editors. Proceedings of the 7th Conference on Parallel Problem Solving from Nature, number 2439 in Lecture Notes in Computer Science. Springer, Berlin, 2002 Guervos et al. [12], pages 537–548.
Jim Smith and T.C. Fogarty. Adaptively parameterised evolutionary systems: Self adaptive recombination and mutation in a genetic algorithm. In W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors. Proceedings of the 4th Conference on Parallel Problem Solving from Nature, number 1141 in Lecture Notes in Computer Science. Springer, Berlin, 1996 Voigt et al. [43], pages 441–450.
Jim Smith and T.C. Fogarty. Self adaptation of mutation rates in a steady state genetic algorithm. In Proceedings of the 1996 IEEE Conference on Evolutionary Computation, pages 318–323. IEEE Press, Piscataway, NJ, 1996.
R. Unger and J. Moult. Genetic algorithms for protein folding simulations. Journal of Theoretical Biology, 231(1):75–81, 1993.
Ron Unger and John Moult. A genetic algorithm for 3D Protein Folding Simulations. In S. Forrest, editor, Proceedings of the 5th International Conference on Genetic Algorithms, pages 581–588. Morgan Kaufmann, San Francisco, 1993.
F. Vavak, T.C Fogarty, and K. Jukes. A genetic algorithm with variable range of local search for tracking changing environments. In W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors. Proceedings of the 4th Conference on Parallel Problem Solving from Nature, number 1141 in Lecture Notes in Computer Science. Springer, Berlin, 1996 Voigt et al. [43], pages 376–385.
H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors. Proceedings of the 4th Conference on Parallel Problem Solving from Nature, number 1141 in Lecture Notes in Computer Science. Springer, Berlin, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Smith, J.E. (2005). The Co-Evolution of Memetic Algorithms for Protein Structure Prediction. In: Hart, W.E., Smith, J.E., Krasnogor, N. (eds) Recent Advances in Memetic Algorithms. Studies in Fuzziness and Soft Computing, vol 166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32363-5_6
Download citation
DOI: https://doi.org/10.1007/3-540-32363-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22904-9
Online ISBN: 978-3-540-32363-1
eBook Packages: EngineeringEngineering (R0)