Evolutionary computation in bioinformatics: A review

IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews

Volumn 36, Issue 5, 2006, Pages 601-615

  Pal, Sankar K ^a   Bandyopadhyay, Sanghamitra ^a   Ray, Shubhra Sankar ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Biocomputing; data mining; evolutionary algorithm; molecular biology; soft computing

Indexed keywords

BIOCOMPUTING; DEOXYRIBONUCLEIC ACIDS; EVOLUTIONARY COMPUTATIONS; FRAGMENT ASSEMBLIES; GENE FINDINGS; GENE MAPPINGS; GENE REGULATORY NETWORKS; GENE SEQUENCE ANALYSIS; LIGAND DESIGNS; MICROARRAY ANALYSIS; MOLECULAR DOCKING; PHYLOGENETIC TREES; RESEARCH ACTIVITIES; RIBONUCLEIC ACIDS; STRUCTURE PREDICTIONS; GENE REGULATORY NETWORK ANALYSIS;

BIOCHEMISTRY; BIOINFORMATICS; DNA; ELECTRIC NETWORK ANALYSIS; GENES; INFORMATION MANAGEMENT; MOLECULAR BIOLOGY; MOLECULAR STRUCTURE; NUCLEIC ACIDS; ORGANIC ACIDS; RNA; SOFT COMPUTING; DNA SEQUENCES; EVOLUTIONARY ALGORITHMS; GENETIC ENGINEERING; MICROARRAYS;

EVOLUTIONARY ALGORITHMS; BIOINFORMATICS;

EID: 33947107404     PISSN: 10946977     EISSN: 15582442     Source Type: Journal    
DOI: 10.1109/TSMCC.2005.855515     Document Type: Article

References (121)

1. P. Baldi and S. Brunak, Bioinformatics: The Machine Learning Approach. Cambridge, MA: MIT Press, 1998.
2. R. B. Altman, A. Valencia, S. Miyano, and S. Ranganathan, “Challenges for intelligent systems in biology,” IEEE Intell. Syst., vol. 16, no. 6, pp. 14–20, Nov./Dec. 2001.
3. D. Goldberg, Genetic Algorithms in Optimization, Search, and Machine Learning. Reading, MA: Addison-Wesley, 1989.
4. D. Bhandari, C. A. Murthy, and S. K. Pal, “Genetic algorithm with elitist model and its convergence,” Int. J. Pattern Rcognit. Artif. Intell., vol. 10, no. 6, pp. 731–747, 1996.
5. L. B. Booker, D. E. Goldberg, and J. H. Holland, “Classifier systems and genetic algorithms,” Artif. Intell., vol. 40, no. 1–3, pp. 235–282, 1989.
6. M. Mitchell, S. Forrest, and J. H. Holland, “The royal road for genetic algorithms: Fitness landscapes and GA performance,” in Proc. 1st Eur. Conf. Artificial Life, 1992.
7. D. E. Goldberg and J. H. Holland, “Genetic algorithms and machine learning,” Mach. Learn., vol. 3, pp. 95–100, 1988.
8. J. H. Holland, Adaptation in Natural and Artificial Systems. Cambridge, MA: MIT Press, 1992.
9. L. Davis, Handbook of Genetic Algorithm. New York: Van Nostrand Reinhold, 1991.
10. J. Setubal and J. Meidanis, Introduction to Computational Molecular Biology. Boston, MA: Thomson, 1999.
11. A. S. Wu and R. K. Lindsay, “A survey of intron research in genetics,” in Proc. 4th Conf. Parallel Problem Solving from Nature, pp. 101–110, 1996.
12. J. Chen, E. Antipov, B. Lemieux, W. Cedeno, and D. H. Wood, “DNA computing implementing genetic algorithms,” in Evolution as Computation, New York: Springer-Verlag, pp. 39–49, 1999.
13. R. J. Parsons, S. Forrest, and C. Burks, “Genetic algorithms, operators, and DNA fragment assembly,” Mach. Learn., vol. 21, no. 1–2, pp. 11–33, 1995.
14. R.J. Parsons, S. Forrest and C. Burks, “Genetic algorithms for DNA sequence assembly,” in Proc. 1st Int. Conf. Intelligent Systems in Molecular Biology, pp. 310–318, 1993.
15. R. J. Parsons and M. E. Johnson, “DNA fragment assembly and genetic algorithms. New results and puzzling insights,” in Int. Conf. Intelligent Systems in Molecular Biology, 1995, pp. 277–284.
16. S. B. Needleman and C. D. Wunsch, “A general method applicable to the search for similarities in the amino acid sequence of two proteins,” J. Mol. Biol., vol. 48, pp. 443-453, 1970.
17. T. F. Smith and M. S. Waterman, “Identification of common molecular sequences,” J. Mol. Biol., vol. 147, pp. 195–197, 1981.
18. E. Aart and V. P. Laarhoven, Simulated Annealing: A Review of Theory and Applications. Norwell, MA: Kluwer, 1987.
19. C. Lawrence, S. Altschul, M. Boguski, J. Liu, A. Neuwald, and J. Wootton, “Detecting subtle sequence signals: A Gibbs sampling strategy for multiple alignment,” Science, vol. 262, pp. 208–214, 1993.
20. C. Notredame and D. G. Higgins, “SAGA: Sequence alignment by genetic algorithm,” Nucleic Acids Res., vol. 24, no. 8, pp. 1515–1524, 1996.
21. C. Zhang and A. K. C. Wong, “A genetic algorithm for multiple molecular sequence alignment,” Bioinformatics, vol. 13, pp. 565–581, 1997.
22. L. Davis, “Adapting operator probabilities in genetic algorithms,” in Proc. 3rd Int. Conf. Genetic Algorithms, J. D. Schaffer, Ed., 1989, pp. 61–69.
23. T. Yokoyama, T. Watanabe, A. Taneda, and T. Shimizu, “A web server for multiple sequence alignment using genetic algorithm,” Genome Inf., vol. 12, pp. 382-383,2001.
24. O. O'sullivan, K. Suhre, C. Abergel, D. G. Higgins, and C. Notredame, “3DCoffee: Combining protein sequences and structures within multiple sequence alignments,” J. Mol. Biol., vol. 340, no. 2, pp. 385–395, 2004.
25. C. Notredame, E. A. O’Brien, and D. G. Higgins, “RAGA: RNA sequence alignment by genetic algorithm,” Nucleic Acids Res., vol. 25, no. 22, pp.4570-4580, 1997.
26. J. D. Thompson, D. G. Higgins, and T. J. Gibson, “CLUSTAL W: Improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice,” Nucleic Acids Res., vol. 22, pp. 4673-4680, 1994.
27. C. Zhang and A. K. C. Wong, “A technique of genetic algorithm and sequence synthesis for multiple molecular sequence alignment,” in Proc. IEEE Int. Conf. Syst. Man, and Cybernetics, vol. 3, 1998, pp. 2442–2447.
28. C. Zhang and A. K. C. Wong, “Toward efficient multiple molecular sequence alignment: A system of genetic algorithm and dynamic programming,” IEEE Trans. Syst. Man, Cybern. B, vol. 27, no. 6, pp. 918–932, Dec. 1997.
29. T. Murata and H. Ishibuchi, “Positive and negative combination effects of crossover and mutation operators in sequencing problems,” Evol. Comput., vol. 20–22, pp. 170–175, 1996.
30. C. Zhang, “A genetic algorithm for molecular sequence comparison,” in Proc. IEEE Int. Conf. Systems, Man, and Cybernetics, vol. 2, 1994, pp. 1926–1931.
31. J. D. Szustakowski and Z. Weng, “Protein structure alignment using a genetic algorithm,” Proteins, vol. 38, no. 4, pp. 428–440, 2000.
32. K. Hanada, T. Yokoyama, and T. Shimizu, “Multiple sequence alignment by genetic algorithm,” Genome Inf., vol. 11, pp. 317–318, 2000.
33. L. A. Anbarasu, P. Narayanasamy, and V. Sundararajan, “Multiple molecular sequence alignment by island parallel genetic algorithm,” Current Sci., vol. 78, no. 7, pp. 858–863, 2000.
34. H. D. Nguyen, I. Yoshihara, K. Yamamori, and M. Yasunaga, “A parallel hybrid genetic algorithm for multiple protein sequence alignment,” in Proc. Congress Evolutionary Computation, vol. 1, 2002, pp. 309–314.
35. C. Gaspin and T. Schiex, “Genetic algorithms for genetic mapping,” in Proc. 3rd Eur. Conf. Artificial Evolution, 1997, pp. 145–156.
36. J. Gunnels, P. Cull, and J. L. Holloway, “Genetic algorithms and simulated annealing for gene mapping,” in Proc. 1st IEEE Conf. Evolutionary Computation, 1994, pp. 385–390.
37. H. Murao, H. Tamaki, and S. Kitamura, “A coevolutionary approach to adapt the genotype-phenotype map in genetic algorithms,” in Proc. Congress Evolutionary Computation, vol. 2, 2002, pp. 1612–1617.
38. J. Fickett and M. Cinkosky, “A genetic algorithm for assembling chromosome physical maps,” in Proc. 2nd Int. Conf. Bioinformatics, Supercomputing, and Complex Genome Analysis, 1993, pp. 272–285.
39. J. W. Fickett, “Finding genes by computer: The state of the art,” Trends Genetics, vol. 12, no. 8, pp. 316–320, 1996.
40. A. Kel, A. Ptitsyn, V. Babenko, S. Meier-Ewert, and H. Lehrach, “A genetic algorithm for designing gene family-specific oligonucleotide sets used for hybridization: The G protein-coupled receptor protein superfamily,” Bioinformatics, vol. 14, no. 3, pp. 259–270, 1998.
41. V. G. Levitsky and A. V. Katokhin, “Recognition of eukaryotic promoters using a genetic algorithm based on iterative discriminant analysis,” In Silico Biol., vol. 3, no. 1–2, pp. 81–87, 2003.
42. S. Knudsen, “Promoter2.0: For the recognition of PolII promoter sequences,” Bioinformatics, vol. 15, pp. 356–361, 1999.
43. N. M. Luscombe, D. Greenbaum, and M. Gerstein, “What is bioinformatics? A proposed definition and overview of the field,” in Yearbook Medical Informatics: Edmonton, AB, Canada: IMIA, 2001, pp. 83–100.
44. J. Quackenbush, “Computational analysis of microarray data,” Nat. Rev. Genetics, vol. 2, pp. 418-427, 2001.
45. H. K. Tsai, J. M. Yang, and C. Y. Kao, “Applying genetic algorithms to finding the optimal order in displaying the microarray data,” in Proc. GECCO, 2002, pp. 610–617.
46. H. K. Tsai, J. M. Yang, Y. F. Tsai, and C. Y. Kao, “An evolutionary approach for gene expression patterns,” IEEE Trans. Inf. Technol. Biomed., vol. 8, no. 2, pp. 69–78, Jun. 2004.
47. A. S. Wu and I. Garibay, “The proportional genetic algorithm: Gene expression in a genetic algorithm,” Genetic Programm. Evol. Hardware, vol. 3, no. 2, pp. 157–192, 2002.
48. T. Akutsu, S. Miyano, and S. Kuhara, “Identification of genetic networks from a small number of gene expression patterns under the boolean network model,” in Proc. Pacific Symp. Biocomputing, vol. 99, 1999, pp. 17–28.
49. S. Ando and H. Iba, “Inference of gene regulatory model by genetic algorithms,” in Proc. Congress Evolutionary Computation, vol. 1, 2001, pp. 712–719.
50. N. Behera and V. Nanjundiah, “Trans gene regulation in adaptive evolution: A genetic algorithm model,”J. Theore. Biol., vol. 188, pp. 153–162, 1997.
51. S. Ando and H. Iba, “Quantitative modeling of gene regulatory network-identifying the network by means of genetic algorithms,” presented at the 11th Genome Informatics Workshop, 2000.
52. S. Ando and H. Iba, “The matrix modeling of gene regulatory networks-reverse engineering by genetic algorithms-,” in presented at the Atlantic Symp. Computational Biology and Genome Information Systems and Technology, 2001.
53. D. Tominaga, M. Okamoto, Y. Maki, S. Watanabe, and Y. Eguchi, “Non-linear numerical optimization technique based on a genetic algorithm for inverse problems: Towards the inference of genetic networks,” Comput. Science and Biology (Proc. German Conf. Bioinformatics), 1999, pp. 127-140.
54. P. O. Lewis, “A genetic algorithm for maximum likelihood phylogeny inference using nucleotide sequence data,” Mol. Biol. Evol., vol. 15, no. 3, pp. 277–283, 1998.
55. A. R. Lemmon and M. C. Milinkovitch, “The metapopulation genetic algorithm: An efficient solution for the problem of large phylogeny estimation,” Proc. Nat. Acad. Sci., vol. 99, no. 16, pp. 10516–10521, 2002.
56. K. Katoh, K. Kuma, and T. Miyata, “Genetic algorithm-based maximum-likelihood analysis for molecular phylogeny,”J. Mol. Evol., vol. 53, no. 4–5, pp. 477–484, 2001.
57. H. Matsuda, “Protein phylogenetic inference using maximum likelihood with a genetic algorithm,” Pacific Symp. Biocomputing, 1996, pp. 512—523.
58. A. Skourikhine, “Phylogenetic tree reconstruction using self-adaptive genetic algorithm,” in IEEE Int. Symp. Bio-Informatics and Biomedical Engineering, 2000, pp. 129–134.
59. P. Baldi and P. F. Baisnee, “Sequence analysis by additive scales: DNA structure for sequences and repeats of all lengths,” Bioinformatics, vol. 16, pp.865-889, 2000.
60. C. Anselmi, G. Bocchinfuso, P. De Santis, M. Savino, and A. Scipioni, “A theoretical model for the prediction of sequence-dependent nucleosome thermodynamic stability,” J. Biophys., vol. 79, no. 2, pp. 601–613, 2000.
61. L. D. Landau and E. M. Lifshitz, Theory of Elasticity. New York: Pergamon, 1970.
62. M. L. Beckers, L. M. Buydens, J. A. Pikkemaat, and C. Altona, “Application of a genetic algorithm in the conformational analysis of methylene-acetal-linked thymine dimers in DNA: Comparison with distance geometry calculations,” J. Biomol. NMR, vol. 9, no. 1, pp. 25–34, 1997.
63. R. V. Parbhane, S. Unniraman, S. S. Tambe, V. Nagaraja, and B. D. Kulkarni, “Optimum DNA curvature using a hybrid approach involving an artificial neural network and genetic algorithm,” J. Biomol. Struct. Dyn., vol. 17, no. 4, pp. 665–672, 2000.
64. J. P. Adrahams and M. Breg, “Prediction of RNA secondary structure including pseudoknotting by computer simulation,” Nucleic Acids Res., vol. 18, pp. 3035–3044, 1990.
65. M. Waterman, “RNA structure prediction,” in Methods in Enzymology. San Diego, CA: Academic, vol. 164, 1988.
66. M. Zuker and P. Stiegler, “Optimal computer folding of large RNA sequences using thermo-dynamics and auxiliary information,” Nucleic Acids Res.,vol. 9, pp. 133–148, 1981.
67. V. Batenburg, A. P. Gultyaev, and C. W. A. Pleij, “An APL-programmed genetic algorithm for the prediction of RNA secondary structure,” J. Theoret. Biol., vol. 174, no. 3, pp. 269–280, 1995.
68. A. P. Gultyaev, V. Batenburg, and C. W. A. Pleij, “The computer simulation of RNA folding pathways using an genetic algorithm,” J. Mol. Biol., vol. 250, pp. 37–51, 1995.
69. K. C. Wiese and E. Glen, “A permutation-based genetic algorithm for the RNA folding problem: A critical look at selection strategies, crossover operators, and representation issues,” Biosystems, vol. 72, no. 1–2, pp. 29-41,2003.
70. B. A. Shapiro and J. Navetta, “A massively parallel genetic algorithm for RNA secondary structure prediction,” J. Supercomput., vol. 8, pp. 195-207, 1994.
71. B. A. Shapiro and J. C. Wu, “An annealing mutation operator in the genetic algorithms for RNA folding,” Comput. Appl. Biosci., vol. 12, pp. 171–180, 1996.
72. B. A. Shapiro, J. C. Wu, D. Bengali, and M. J. Potts, “The massively parallel genetic algorithm for RNA folding: MIMD implementation and population variation,” Bioinformatics, vol. 17, no. 2, pp. 137–148, 2001.
73. P. Chou and G. Fasmann, “Prediction of the secondary structure of proteins from their amino acid sequence,” Adv. Enzymol., vol. 47, pp. 145–148, 1978.
74. S. K. Riis and A. Krogh, “Improving prediction of protein secondary structure using structured neural networks and multiple sequence alignments,” J. Comput. Biol., vol. 3, pp. 163–183, 1996.
75. N. Qian and T. J. Sejnowski, “Predicting the secondary structure of globular proteins using neural network models,” J. Mol. Biol., vol. 202, no. 4, pp. 865–884, 1988.
76. A. Salamov and V. Solovyev, “Prediction of protein secondary structure by combining nearest-neighbor algorithms and multiple sequence alignments,” J. Mol. Biol, vol. 247, pp. 11–15, 1995.
77. S. Salzberg and S. Cost, “Predicting protein secondary structure with a nearest-neighbor algorithm,” J. Mol. Biol, vol. 227, pp. 371–374, 1992.
78. J. Gamier, J. F. Gibrat, and B. Robson, “GOR method for predicting protein secondary structure from amino acid sequence,” in Methods in Enzymology, vol. 266, 1996, pp. 540–553.
79. R. Unger and J. Moult, “On the applicability of genetic algorithms to protein folding,” in Proc. Hawaii Int. Conf. System Sciences, vol. 1, 1993, pp. 715–725.
80. R. Unger and J. Moult, “Genetic algorithms for protein folding simulations,” J. Mol. Biol, vol. 231, no. 1, pp. 75–81, 1993.
81. R. Unger and J. Moult, “A genetic algorithms for three dimensional protein folding simulations,” in Int. Conf. Genetic Algorithms, 1993, pp. 581–588.
82. A. Patton, E. Goldman, “A standard GA approach to native protein conformation prediction,” in Proc. Int. Conf. Genetic Algorithms, 1995, pp. 574–581.
83. N. Krasnogor, W. E. Hart, J. Smith, and D. A. Pelta, “Protein structure prediction with evolutionary algorithms,” in Proc. Genetic and Evolutionary Computation, vol. 2, 1999, pp. 1596–1601.
84. N. Krasnogor, D. Pelta, P. M. Lopez, P. Mocciola, and E. Canal, “Genetic algorithms for the protein folding problem: A critical view,” in Proc. Engineering Intelligent Systems, 1998
85. L. Cooper, D. Corne, and M. Crabbe, “Use of a novel hill-climbing genetic algorithm in protein folding simulations,” Comput. Biol. Chem., vol. 27, no. 6, pp. 575–580, 2003.
86. S. Bandyopadhyay, “An efficient technique for superfamily classification of amino acid sequences: Feature extraction, fuzzy clustering and prototype selection,” Fuzzy Sets Syst., vol. 152, pp. 5–16, 2005.
87. U. Maulik and S. Bandyopadhyay, “Fuzzy partitioning using real coded variable length genetic algorithm for pixel cassification,” IEEE Trans. Geosci. Remote Sens., vol. 41, no. 5, pp. 1075–1081, May 2003.
88. H. Iijima and Y. Naito, “Incremental prediction of the side-chain conformation of proteins by a genetic algorithm,” in Proc. IEEE Conf. Evolutionary Computation, vol. 1, 1994, pp. 362–367.
89. I. Ono, H. Fujiki, M. Ootsuka, N. Nakashima, N. Ono, and S. Tate, “Global optimization of protein 3-dimensional structures in NMR by a genetic algorithm,” in Proc. Congress Evolutionary Computation, vol. 1, 2002, pp. 303–308.
90. B. Contreras-Moreira, P. W. Fitzjohn, M. Offman, G. R. Smith, and P. A. Bates, “Novel use of a genetic algorithm for protein structure prediction: Searching template and sequence alignment space,” Proteins, vol. 53, no. 6, pp. 424-429, 2003.
91. P. Saxena, I. Whang, Y. Voziyanov, C. Harkey, P. Argos, M. Jayaram, and T. Dandekar, “Probing Flp: A new approach to analyze the structure of a DNA recognizing protein by combining the genetic algorithm, mutagenesis and non-canonical DNA target sites,” Biochem. Biophys. Acta., vol. 1340, no. 2, pp. 187–204, 1997.
92. J. T. Pedersen and J. Moult, “Protein folding simulations with genetic algorithms and a detailed molecular description,” J. Mol. Biol., vol. 269, no. 2, pp. 240–259, 1997.
93. M. Khimasia and P. Coveney, “Protein structure prediction as a hard optimization problem: The genetic algorithm approach,” Mol. Simul., vol. 19, pp.205-226, 1997.
94. R. Konig and T. Dandekar, “Improving genetic algorithms for protein folding simulations by systematic crossover,” BioSystems, vol. 50, pp. 17-25,1999.
95. C. A. Del Carpio, “A parallel genetic algorithm for polypeptide three dimensional structure prediction: A transputer implementation,” J. Chem. Inf. Comput. Sci., vol. 36, no. 2, pp. 258–269, 1996.
96. Rabow and H. A. Scheraga, “Improved genetic algorithm for the protein folding problem by use of a cartesian combination operator,” Protein Sci., vol. 5, pp. 1800–1815, 1996.
97. J. R. Gunn, “Sampling protein conformations using segment libraries and a genetic algorithm,”/. Chemi. Phys., vol. 106, pp. 4270-4281, 1997.
98. A. C. W. May and M. S. Johnson, “Improved genetic algorithm-based protein structure comparisons: Pairwise and multiple superpositions,” Protein Eng., vol. 8, pp. 873–882, 1995.
99. M. J. Bayley, G. Jones, P. Willett, and M. P. Williamson, “Genfold: A genetic algorithm for folding protein structures using NMR restraints,” Protein Sci., vol. 7, no. 2, pp. 491–499, 1998.
100. Z. Sun, X. Xia, Q. Guo, and D. Xu, “Protein structure prediction in a 210-type lattice model: Parameter optimization in the genetic algorithm using orthogonal array,” J. Protein Chem., vol. 18, no. 1, pp. 39-46,1999.
101. S. Schulze-Kremer, “Genetic algorithms and protein folding. Methods in molecular biology,” Protein Structure Prediction: Methods and Protocols, vol. 143, pp. 175–222, 2000.
102. A. M. Lesk, Introduction to Bioinformatics. London, U.K.: Oxford Univ. Press, 2002.
103. Y. Xiao and D. Williams, “Genetic algorithms for docking of actinomycin D and deoxyguanosine molecules with comparison to the crystal structure of actinomycin ddeoxyguanosine complex,” J. Phys. Chem., vol. 98, pp. 7191–7200, 1994.
104. D. R. Westhead, D. E. Clark, D. Frenkel, J. Li, C. W. Murray, B. Robson, and B. Waszkowycz, “PRO-LIGAND: An approach to de novo molecular design. 3. A genetic algorithm for structure refinement,”J. Comput.- Aided Mol. Design, vol. 9, no. 2, pp. 139–148, 1995.
105. G. M. Morris, D. S. Goodsell, R. S. Halliday, R. Huey, W. E. Hart, R. K. Belew, and A. J. Olsoni, “Automated docking using a Lamarckian genetic algorithm and an empirical binding free energy function,”J. Comput. Chem., vol. 19, no. 14, pp. 1639–1662, 1998.
106. A. Bagchi, S. Bandyopadhyay, and U. Maulik, “Determination of molecular structure for drug design using variable string length genetic algorithm,” in Workshop on Soft Computing, High Performance Computing (HiPC) Workshops 2003: New Frontiersin High-Performance Computing, Hyderabad, India, 2003, pp. 145–154.
107. S. Bandyopadhyay, A. Bagchi, and U. Maulik, “Active site driven ligand design: An evolutionary approach,” J. Bioinf. Comput. Biol., vol. 3, no. 5, pp. 1053–1070, 2005.
108. C. Chen, L. H. Wang, C. Kao, M. Ouhyoung, and W. Chen, “Molecular binding in structure-based drug design: A case study of the population-based annealing genetic algorithms,” in Proc. IEEE Int. Conf. Tools with Artificial Intelligence, 1998, pp. 328–335.
109. L. H. Wang, C. Kao, M. Ouh-Young, and W. Chen, “Molecular binding: A case study of the population-based annealing genetic algorithms,” in Proc. IEEE Int. Conf. Evolutionary Computation, 1995, pp. 50–55.
110. L. H. Wang, C. Kao, M. Ouh-Young, and W. C. Cheu, “Using an annealing genetic algorithm to solve global energy minimization problem in molecular binding,” in Proc. 6th Int. Conf. Tools with Artificial Intelligence, 1994, pp. 404-410.
111. C. D. Rosin, R. S. Halliday, W. E. Hart, and R. K. Belew, “Acomparison of global and local search methods in drug docking,” in Proc. Int. Conf. Genetic Algorithms, 1997, pp. 221–228.
112. J. M. Yang and C. Y. Kao, “A family competition evolutionary algorithm for automated docking of flexible ligands to proteins,” IEEE Trans. Inf. Technol. Biomed., vol. 4, no. 3, pp. 225–237, Sep. 2000.
113. C. M. Oshiro, I. D. Kuntz, and J. S. Dixon, “Flexible ligand docking using a genetic algorithm,” J. Comput.-Aided Mol. Design, vol. 9, no. 2, pp.113-130, 1995.
114. D. E. Clark and D. R. Westhead, “Evolutionary algorithms in computer-aided molecular design,” J. Comput.-Aided Mol. Design, vol. 10, no. 4, pp. 337–358, 1996.
115. V. Venkatasubramanian, K. Chan, and J. Caruthers, “Computer aided molecular design using genetic algorithms,” Comput. Chem. Eng., vol. 18, no. 9, pp. 833–844, 1994.
116. D. M. Deaven and K. O. Ho, “Molecular-geometry optimization with a genetic algorithm,” Phys. Rev. Lett., vol. 75, no. 2, pp. 288–291, 1995.
117. G. Jones, P. Willett, and R. C. Glen, “Molecular recognition of receptor sites using a genetic algorithm with a description of desolvation,” J. Mol. Biol., vol. 245, pp. 43–53, 1995.
118. G. Jones, P. Willett, R. C. Glen, A. R. Leach, and R. Taylor, “Further development of a genetic algorithm for ligand docking and its application to screening combinatorial libraries,” American Chemical Society Symposium Series, vol. 719, Washington, DC: ACS, 1999, pp. 271–291.
119. D. B. McGarrah and R. S. Judson, “Analysis of the genetic algorithm method of molecular conformation determination,” J. Comput. Chem., vol. 14, no. 11, pp. 1385–1395, 1993.
120. T. Hou, J. Wang, L. Chen, and X. Xu, “Automated docking of peptides and proteins by using a genetic algorithm combined with a tabu search,” Protein Eng., vol. 12, pp. 639–647, 1999.
121. P. Willet, “Genetic algorithms in molecular recognition and design,” Trends Biotechnol., vol. 13, no. 12, pp. 516–521, 1995.