An annealing mutation operator in the genetic algorithms for RNA folding
暂无分享,去创建一个
[1] Lawrence. Davis,et al. Handbook Of Genetic Algorithms , 1990 .
[2] Michael Zuker,et al. Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information , 1981, Nucleic Acids Res..
[3] M. Zuker. On finding all suboptimal foldings of an RNA molecule. , 1989, Science.
[4] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[5] D. Turner,et al. Improved free-energy parameters for predictions of RNA duplex stability. , 1986, Proceedings of the National Academy of Sciences of the United States of America.
[6] Terence C. Fogarty,et al. Varying the Probability of Mutation in the Genetic Algorithm , 1989, ICGA.
[7] H. Noller,et al. RNA-protein interactions in 30S ribosomal subunits: folding and function of 16S rRNA. , 1989, Science.
[8] William H. Press,et al. Numerical recipes in FORTRAN (2nd ed.): the art of scientific computing , 1992 .
[9] Kalyanmoy Deb,et al. A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.
[10] C. Pleij,et al. A new principle of RNA folding based on pseudoknotting. , 1985, Nucleic acids research.
[11] G. Stormo,et al. Autogenous regulatory site on the bacteriophage T4 gene 32 messenger RNA. , 1988, Journal of molecular biology.
[12] D. Turner,et al. A comparison of optimal and suboptimal RNA secondary structures predicted by free energy minimization with structures determined by phylogenetic comparison. , 1991, Nucleic acids research.
[13] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .