A permutation-based genetic algorithm for the RNA folding problem: A critical look at selection strategies, crossover operators, and representation issues

BioSystems

Volumn 72, Issue 1-2, 2003, Pages 29-41

  Wiese, Kay C ^a   Glen, Edward ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Genetic algorithms; Genetic operators; Representation; RNA secondary structure prediction; Selection

Indexed keywords

RNA;

BIOINFORMATICS; GENETIC ALGORITHM; RNA;

ARTICLE; BASE PAIRING; CATALYSIS; COMPUTER PREDICTION; GENETIC ALGORITHM; HYDROGEN BOND; INTERMETHOD COMPARISON; NUCLEOTIDE SEQUENCE; PROTEIN DOMAIN; PROTEIN FOLDING; PROTEIN FUNCTION; PROTEIN SECONDARY STRUCTURE; RNA STRUCTURE; TRANSCRIPTION INITIATION; TRANSCRIPTION REGULATION;

EID: 0345293275     PISSN: 03032647     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0303-2647(03)00133-3     Document Type: Article

References (37)

1. Altenberg, L., 1994. The evolution of evolvability in genetic programming. In: Kinnear, K. (Ed.), Advances in Genetic Programming. MIT Press, pp. 47-74.
2. Bäck, T., 1996. Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press.
3. Chen, J.H., Shi-Yun, L., Maizel, J.V., 2000. Prediction of common secondary structures of RNAs: a genetic algorithm approach. Oxford University Press, pp. 991-999. Nucleic Acids Res. 28 (4).
4. Currey K.M., Shapiro B.A. Secondary structure computer prediction of the poliovirus 5′ non-coding region is improved by a genetic algorithm. Comput. Appl. Biosci. 13(1):1997;1-12.
5. Davis, L., 1985. Job shop scheduling with genetic algorithms. In: Proceedings of the 1st International Conference on Genetic Algorithms ICGA-85. pp. 136-140.
6. Eshelman, L., 1991. The CHC adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination. In: Foundations of Genetic Algorithms. Morgan Kaufmann, pp. 265-283.
7. Fogel, L.J., 1999. Intelligence through simulated evolution: forty years of evolutionary programming. In: Wiley Series on Intelligent Systems. pp. 143-156.
8. Fogel, L.J., Owens, A.J., Walsh, M.J., 1966. Artificial Intelligence Through Simulated Evolution. Wiley, New York.
9. Fogel G.B., Porto V.W., Weekes D.G., Fogel D.B., Griffey R.H., McNeil J.A., Lesnik E., Ecker D.J., Sampath R. Discovery of RNA structural elements using evolutionary computation. Nucleic Acids Res. 30(23):2002;5310-5317.
10. Goldberg, D.E., Lingle Jr., R., 1985. Alleles, loci, and the traveling salesman problem. In: Proceedings of the 1st International Conference on Genetic Algorithms ICGA-85. pp. 154-159.
11. Gultyaev A.P., Van Batenburg F.H.D., Pleij C.W.A. The computer simulation of RNA folding pathways using a genetic algorithm. J. Mol. Biol. 250:1995;37-51.
12. Gultyaev A.P., Van Batenburg F.H.D., Pleij C.W.A. RNA folding dynamics: computer simulations by a genetic algorithm. Mol. Model. Nucleic Acids ACS Symp. Series. 682:1998;229-245.
13. Higgs, P.G., 2000. RNA secondary structure: physical and computational aspects. Q. Rev. Biophys. 33 (3) 199-253.
14. Holland, J.H., 1975. Adaptation in Natural and Artificial Systems. Michigan University Press, Ann Arbor, MI.
15. Koza, J.R., 1992. Genetic programming: on the programming of computers by means of natural selection. In: Complex Adaptive Systems. MIT Press, Cambridge, MA.
16. Mahfoud, S.W., 1992. Crowding and preselection revisited. In: Parallel Problem Solving from Nature PPSN-II. pp. 27-36.
17. Major, F., 2003. Laboratoire de Biologie Informatique et Théorique. University de Montreal, Montréal, Canada (personal communication).
18. Merz, P., Freisleben B., 1997. Genetic local search for the TSP: new results. In: Proceedings of the 1997 IEEE International Conference on Evolutionary Computation. IEEE Press, pp. 159-164.
19. Oliver, I.M., Smith, D.J., Holland, J.R.C., 1987. A study on permutation crossover operators on the traveling salesman problem. In: Proceedings of the 2nd International Conference on Genetic Algorithms ICGA-8. pp. 224-230.
20. Rechenberg, I., 1973. Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Fromman-Holzboog Verlag, Stuttgart, Germany.
21. Reyes C.M., Kollman P.A. Structure and thermodynamics of RNA-protein binding: using molecular dynamics and free energy analyses to calculate the free energies of binding and conformational change. J. Mol. Biol. 297:2000;1145-1158.
22. Schuster P., Stadler P.F., Renner A. RNA structures and folding: from conventional to new issues in structure predictions. Curr. Opin. Struct. Biol. 7(2):1997;229-235.
23. Schwefel, H.-P., 1965. Kybernetische Evolution als Strategie der experimentellen Forschung in der Strömungstechnik. Diploma Thesis, Technical University of Berlin.
24. Schwefel, H.-P., 1977. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. In: Interdisciplinary Systems Research 26. Birkhäuser, Basel.
25. Shapiro B.A., Navetta J. A massively parallel genetic algorithm for RNA secondary structure prediction. J. Supercomput. 8(3):1994;195-207.
26. Shapiro B.A., Wu J.C. An annealing mutation operator in the genetic algorithms for RNA folding. Comput. Appl. Biosci. 12(3):1996;171-180.
27. Shapiro B.A., Wu J.C., Bengali D., Potts M.J. The massively parallel genetic algorithm for RNA folding: MIMD implementation and population variation. Bioinformatics. 17(2):2001;137-148.
28. Tacker M., Stadler P.F., Bornberg-Bauer E.G., Hofacker I.L., Schuster P. Algorithm independent properties of RNA secondary structure predictions. Eur. Biophys. J. 25:1996;115-130.
29. Thierens, D., Goldberg, D.E., 1994. Elitist recombination: an integrated selection recombination GA. In: Proceedings of the IEEE World Congress on Computational Intelligence WCCI-94 (1). pp. 508-512.
30. Tinoco I. Jr., Bustamante C. How RNA folds. J. Mol. Biol. 293:1999;271-281.
31. Titov I.I., Vorobiev D.G., Ivanisenko V.A., Kolchanov N.A. A fast genetic algorithm for RNA secondary structure analysis. Russian Chem. Bull. Int. Ed. 51(7):2002;1135-1144.
32. Van Batenburg F.H.D., Gultyaev A.P., Pleij C.W.A. An APL-programmed genetic algorithm for the prediction of RNA secondary structure. J. Theor. Biol. 174(3):1995;269-280.
33. Whitley, D., Starkweather, T., Fuquay, D'A., 1989. Scheduling problems and traveling salesman: the genetic edge recombination operator. In: Proceedings of the 3rd International Conference on Genetic Algorithms ICGA-89. pp. 133-140.
34. Whitley, D., Starkweather, T., Shaner D., 1990. The traveling salesman and sequence scheduling: quality solutions using genetic edge recombination. In: Davis, L. (Ed.), Handbook of Genetic Algorithms. Thomson Computer Press (Chapter 22).
35. Wiese, K.C., Glen, E., 2002. A permutation based genetic algorithm for RNA secondary structure prediction. In: Abraham, A., Ruiz-del-Solar, J., Köppen, M. (Eds.), Frontiers in Artificial Intelligence and Applications 87. IOS Press, pp. 173-182.
36. Wiese, K.C., Goodwin, S.D., 2001. Keep-Best Reproduction: A Local Family Competition Selection Strategy and the Environment it Flourishes in. Constraints 6, 399-422.
37. Wiese, K.C., Goodwin, S.D., Nagarajan, S., 2000. ASERC - a genetic sequencing operator for asymmetric permutation problems. In: Lecture Notes in Artificial Intelligence 1822. Springer Verlag, pp. 201-213.