Naturally selecting solutions: The use of genetic algorithms in bioinformatics

Bioengineered

Volumn 4, Issue 5, 2013, Pages

  Manning, Timmy ^a   Sleator, Roy D ^a   Walsh, Paul ^a  

^a Ireland   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; BIOINFORMATICS; CROSSING OVER; GENE MUTATION; GENETIC ALGORITHM; GENETIC SELECTION; GENETIC VARIABILITY; GENOTYPE; MOLECULAR DOCKING; MUTATION RATE; PHENOTYPE; PROTEIN FOLDING; PROTEIN STRUCTURE; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS;

EID: 84878755856     PISSN: 19491018     EISSN: 19491026     Source Type: Journal    
DOI: 10.4161/bioe.23041     Document Type: Article

References (87)

1. Holland JH. Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press 1975; 2.
2. Jiang W, Baker ML, Ludtke SJ, Chiu W. Bridging the information gap: computational tools for intermediate resolution structure interpretation. J Mol Biol 2001; 308:1033-44. PMID:11352589; http://dx.doi.org/10.1006/jmbi.2001.4633.
3. Kumar SN, Panneerselvam R. A Survey on the Vehicle Routing Problem and Its Variants. Intelligent Information Management 2012; 4:66-74; http://dx.doi.org/10.4236/iim.2012.43010.
4. Gemperline P, Niazi A, Leardi R. Genetic algorithms in chemometrics. J Chemometr 2012; 26:345-51; http://dx.doi.org/10.1002/cem.2426.
5. Sharma RN, Pancholi SS. Optimization techniques in pharmaceutical industry: A Review. Journal of Current Pharmaceutical Research 2011; 7:21-8.
6. McDowell JJ, Popa A. Toward a mechanics of adaptive behavior: evolutionary dynamics and matching theory statics. J Exp Anal Behav 2010; 94:241-60. PMID:21451751; http://dx.doi.org/10.1901/jeab.2010.94-241.
7. Álvarez D, Hornero R, Marcos JV, del Campo F. Feature selection from nocturnal oximetry using genetic algorithms to assist in obstructive sleep apnoea diagnosis. Med Eng Phys 2012; 34:1049-57. PMID:22154238.
8. Tian H, Liu C, Gao XD, Yao WB. Optimization of auto-induction medium for G-CSF production by Escherichia coli using artificial neural networks coupled with genetic algorithm. World J Microbiol Biotechnol 2012;1-9. PMID:23132252.
9. Naznin F, Sarker R, Essam D. Vertical decomposition with Genetic Algorithm for Multiple Sequence Alignment. BMC Bioinformatics 2011; 12:353. PMID:21867510; http://dx.doi.org/10.1186/1471-2105-12-353.
10. Wongsarnpigoon A, Grill WM. Energy-efficient waveform shapes for neural stimulation revealed with a genetic algorithm. J Neural Eng 2010; 7:046009. PMID:20571186; http://dx.doi.org/10.1088/1741-2560/7/4/046009.
11. Zaki N, Bouktif S, Lazarova-Molnar S. A combination of compositional index and genetic algorithm for predicting transmembrane helical segments. PLoS One 2011; 6:e21821. PMID:21814556; http://dx.doi.org/10.1371/journal.pone.0021821.
12. Agrawal D, Jaiswal HL, Singh I, Chandrasekaran K. An Evolutionary Approach to Optimizing Cloud Services. Computer Engineering and Intelligent Systems 2012; 3:47-54.
13. Larranaga P, Kuijpers CMH, Murga RH, Inza I, Dizdarevic S. Genetic algorithms for the travelling salesman problem: A review of representations and operators. Artif Intell Rev 1999; 13:129-70;http://dx.doi.org/10.1023/A:1006529012972.
14. Acuña DE, Parada V. People efficiently explore the solution space of the computationally intractable traveling salesman problem to find near-optimal tours. PLoS One 2010; 5:e11685. PMID:20686597; http://dx.doi.org/10.1371/journal.pone.0011685.
15. Urquhart N, Scott C, Hart E. Using an evolutionary algorithm to discover low CO 2 tours within a travelling salesman problem. Applications of Evolutionary Computation 2010:421-30;http://dx.doi.org/10.1007/978-3-642-12242-2_43.
16. Bellman R. Dynamic programming treatment of the travelling salesman problem. [JACM]. J ACM 1962; 9:61-3; http://dx.doi.org/10.1145/321105.321111.
17. Held M, Karp RM. A dynamic programming approach to sequencing problems. J Soc Ind Appl Math 1962; 10:196-210;http://dx.doi.org/10.1137/0110015.
18. Deineko VG, Woeginger GJ. A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. Math Program 2000; 87:519-42;http://dx.doi.org/10.1007/s101070050010.
19. Hahsler M, Hornik K. TSP-Infrastructure for the traveling salesperson problem. 2006.
20. Hu T, Payne JL, Banzhaf W, Moore JH. Evolutionary dynamics on multiple scales: a quantitative analysis of the interplay between genotype, phenotype, and fitness in linear genetic programming. Genet Program Evolvable Mach 2012:1-33.
21. Raffe WL, Zambetta F, Li X. A survey of procedural terrain generation techniques using evolutionary algorithms. Evolutionary Computation (CEC), 2012 IEEE Congress on: IEEE, 2012:1-8.
22. Qodmanan HR, Nasiri M, Minaei-Bidgoli B. Multi objective association rule mining with genetic algorithm without specifying minimum support and minimum confidence. Expert Syst Appl 2011; 38:288-98; http://dx.doi.org/10.1016/j.eswa.2010.06.060.
23. Bakirli G, Birant D, Kut A. An incremental genetic algorithm for classification and sensitivity analysis of its parameters. Expert Syst Appl 2011; 38:2609-20; http://dx.doi.org/10.1016/j.eswa.2010.08.051.
24. Lehman J, Stanley KO. Abandoning objectives: evolution through the search for novelty alone. Evol Comput 2011; 19:189-223. PMID:20868264; http://dx.doi.org/10.1162/EVCO_a_00025.
25. Xie H, Zhang M. Parent Selection Pressure Autotuning for Tournament Selection in Genetic Programming. 2011.
26. Fernandez M, Caballero J, Fernandez L, Sarai A. Genetic algorithm optimization in drug design QSAR: Bayesian-regularized genetic neural networks (BRGNN) and genetic algorithm-optimized support vectors machines (GA-SVM). Mol Divers 2011; 15:269-89. PMID:20306130; http://dx.doi.org/10.1007/s11030-010-9234-9.
27. Kwak NS, Lee J. An implementation of new selection strategies in a genetic algorithm-population recombination and elitist refinement. Eng Optim 2011; 43:1367-84;http://dx.doi.org/10.1080/0305215X.2011.558577.
28. Lucas AW, Michelle DM. Cross-pollinating parallel genetic algorithms for multi-objective search and optimization. Int J Found Comput Sci 2005; 16:261-80; http://dx.doi.org/10.1142/S012905410500298X.
29. Jerin Leno I, Saravana Sankar S, Victor Raj M, Ponnambalam S. An elitist strategy genetic algorithm for integrated layout design. Int J Adv Manuf Technol 2012:1-17.
30. Whitley D. The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. Proceedings of the third international conference on Genetic algorithms, 1989:116-21.
31. Sudholt D. Crossover speeds up building-block assembly. Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference: ACM, 2012:689-702.
32. Wong M, Pao WKS. A genetic algorithm for optimizing gravity die casting's heat transfer coefficients. Expert Syst Appl 2011; 38:7076-80; http://dx.doi.org/10.1016/j.eswa.2010.12.063.
33. Chen SH, Chang PC, Cheng T, Zhang Q. A Selfguided Genetic Algorithm for permutation flowshop scheduling problems. Comput Oper Res 2012; 39:1450-7; http://dx.doi.org/10.1016/j. cor.2011.08.016.
34. Yang CH, Cheng YH, Chuang LY, Changi HW. Confronting two-pair primer design for enzyme-free SNP genotyping based on a genetic algorithm. BMC Bioinformatics 2010; 11:509.
35. Eiben A, Raué P, Ruttkay Z. Genetic algorithms with multi-parent recombination. Parallel Problem Solving from Nature-PPSN III 1994:78-87.
36. Ramezanian R, Rahmani D, Barzinpour F. An aggregate production planning model for two phase production systems: Solving with genetic algorithm and tabu search. Expert Syst Appl 2012; 39:1256-63; http://dx.doi.org/10.1016/j.eswa.2011.07.134.
37. Aiello G, La Scalia G, Enea M. A multi objective genetic algorithm for the facility layout problem based upon slicing structure encoding. Expert Syst Appl 2012; http://dx.doi.org/10.1016/j.eswa.2012.01.125.
38. Abedini M, Nasseri M, Burn D. The use of a genetic algorithm-based search strategy in geostatistics: application to a set of anisotropic piezometric head data. Comput Geosci 2012; 41:136-46; http://dx.doi.org/10.1016/j.cageo.2011.08.024.
39. Taylor CM, Agah A. Data Mining and Hypothesis Refinement using a Multi-Tiered Genetic Algorithm. Journal of Intelligent Systems 2010; 19:191-226; http://dx.doi.org/10.1515/JISYS.2010.19.3.191.
40. Nair SSK, Subba Reddy NV, Hareesha KS. Exploiting heterogeneous features to improve in silico prediction of peptide status -amyloidogenic or non-amyloidogenic. BMC Bioinformatics 2011; 12(Suppl 13):S21. PMID:22373069; http://dx.doi.org/10.1186/1471-2105-12-S13-S21.
41. Kallel L, Naudts B, Rogers A. Theoretical aspects of evolutionary computing. Springer, 2001.
42. Rowe W, Platt M, Wedge DC, Day PJ, Kell DB, Knowles J. Analysis of a complete DNA-protein affinity landscape. J R Soc Interface 2010; 7:397-408. PMID:19625306; http://dx.doi.org/10.1098/rsif.2009.0193.
43. Morris MK, Saez-Rodriguez J, Clarke DC, Sorger PK, Lauffenburger DA. Training signaling pathway maps to biochemical data with constrained fuzzy logic: quantitative analysis of liver cell responses to inflammatory stimuli. PLoS Comput Biol 2011; 7:e1001099. PMID:21408212; http://dx.doi.org/10.1371/journal.pcbi.1001099.
44. Lei H, Chen C, Xiao Y, Duan Y. The protein folding network indicates that the ultrafast folding mutant of villin headpiece subdomain has a deeper folding funnel. J Chem Phys 2011; 134:205104. PMID:21639484; http://dx.doi.org/10.1063/1.3596272.
45. Bäck T. Optimal Mutation Rates in Genetic Search. Proceedings of the 5th International Conference on Genetic Algorithms: Morgan Kaufmann Publishers Inc., 1993:2-8.
46. Maaranen H, Miettinen K, Penttinen A. On initial populations of a genetic algorithm for continuous optimization problems. J Glob Optim 2007; 37:405-36; http://dx.doi.org/10.1007/s10898-006-9056-6.
47. Huang M, Narayana VK, Bakhouya M, Gaber J, El-Ghazawi T. Efficient Mapping of Task Graphs onto Reconfigurable Hardware Using Architectural Variants. Computers. IEEE Transactions on 2012; 61:1354-60.
48. Acampora G, Loia V, Salerno S, Vitiello A. A hybrid evolutionary approach for solving the ontology alignment problem. Int J Intell Syst 2012; 27:189-216; http://dx.doi.org/10.1002/int.20517.
49. Siregar MU. A New Approach to CPU Scheduling Algorithm: Genetic Round Robin. Int J Comput Appl 2012; 47:18-25.
50. González-García J, Cordero-Dávila A, Leal-Cabrera I, Robledo-Sánchez CI, Santiago-Alvarado A. Calculating petal tools by using genetic algorithms. Appl Opt 2006; 45:6126-36. PMID:16892113.
51. Eiben AE, Smith JE. Introduction to evolutionary computing. Springer, 2008.
52. Brain ZE, Addicoat MA. Optimization of a genetic algorithm for searching molecular conformer space. J Chem Phys 2011; 135:174106-174110. PMID:22070291; http://dx.doi.org/10.1063/1.3656323.
53. Bauerly M, Liu Y. Evaluation and Improvement of Interface Aesthetics with an Interactive Genetic Algorithm. Int J Hum Comput Interact 2009; 25:155-66; http://dx.doi.org/10.1080/10447310802629801.
54. Nakamichi R, Ukai Y, Kishino H. Detection of closely linked multiple quantitative trait loci using a genetic algorithm. Genetics 2001; 158:463-75. PMID:11333253.
55. Gibbs MS, Maier HR, Dandy GC, Nixon JB. Minimum number of generations required for convergence of genetic algorithms. Evolutionary Computation, 2006 CEC 2006 IEEE Congress on: IEEE, 2006:565-72.
56. Michalewicz Z. Genetic algorithms+ data structures= evolution programs. springer, 1998.
57. Melanie M. An introduction to genetic algorithms. Cambridge, Massachusetts London, England, Fifth printing 1999.
58. Liu C, Kroll A. On designing genetic algorithms for solving small-and medium-scale traveling salesman problems. Swarm and Evolutionary Computation 2012:283-91.
59. Li Y, Hu CJ. Aesthetic learning in an interactive evolutionary art system. Applications of Evolutionary Computation 2010:301-10.
60. Raychaudhuri A, Khandelwal S, Chhalani S, Kakarania N. Image Binarization of Grey Level Images using Elitist Genetic Algorithm. Int J Comput Appl 2012:2012.
61. Nixon KC, Carpenter JM. On homology. Cladistics 2012; 28:160-9; http://dx.doi.org/10.1111/j.1096-0031.2011.00371.x.
62. Kumar S, Filipski A. Multiple sequence alignment: in pursuit of homologous DNA positions. Genome Res 2007; 17:127-35. PMID:17272647; http://dx.doi.org/10.1101/gr.5232407.
63. Thompson JD, Higgins DG, Gibson TJ. CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res 1994; 22:4673-80. PMID:7984417; http://dx.doi.org/10.1093/nar/22.22.4673.
64. Blazewicz J, Frohmberg W, Kierzynka M, Pesch E, Wojciechowski P. Protein alignment algorithms with an efficient backtracking routine on multiple GPUs. BMC Bioinformatics 2011; 12:181. PMID:21599912; http://dx.doi.org/10.1186/1471-2105-12-181.
65. Zufall RA. Beyond Simple Homology Searches: Multiple Sequence Alignments and Phylogenetic Trees. Current Protocols Essential Laboratory Techniques 2009:11.3.1-.3.7.
66. Marti-Renom MA, Madhusudhan MS, Sali A. Alignment of protein sequences by their profiles. Protein Sci 2004; 13:1071-87. PMID:15044736; http://dx.doi.org/10.1110/ps.03379804.
67. da Silva FJM, Pérez JMS, Pulido JA, Rodríguez MA. Parallel Niche Pareto AlineaGA--an evolutionary multiobjective approach on multiple sequence alignment. J Integr Bioinform 2011; 8:174. PMID:21926437.
68. Dayhoff M, Schwartz R, Orcutt B. A Model of Evolutionary Change in Proteins. Atlas of protein sequence and structure 1972; 5:345-52.
69. da Silva FJM, Sánchez-Pérez JM, Gómez-Pulido J, Vega-Rodríguez M. An evolutionary approach for performing multiple sequence alignment. IEEE, 2010:1-7.
70. da Silva FJM, Pérez JMS, Pulido JAG, Rodríguez M. Parallel Alinea GA: An island parallel evolutionary algorithm for multiple sequence alignment. IEEE, 2010:279-84.
71. Horn J, Nafpliotis N, Goldberg DE. A niched Pareto genetic algorithm for multiobjective optimization. Ieee, 1994:82-7 vol. 1.
72. da Silva FJM, Sanchez Perez J, Gomez Pulido J, Rodríguez MAV. Optimizing multiple sequence alignment by improving mutation operators of a genetic algorithm. IEEE, 2009:1257-62.
73. Notredame C, Higgins DG, Heringa J. T-Coffee: A novel method for fast and accurate multiple sequence alignment. J Mol Biol 2000; 302:205-17. PMID:10964570; http://dx.doi.org/10.1006/jmbi.2000.4042.
74. Nizam A. Cyclic Genetic Algorithm for Multiple Sequence Alignment. International Journal of Research and Reviews in Electrical and Computer Engineering (IJRRECE) 2011; 1.
75. Wang RYR, Han Y, Krassovsky K, Sheffler W, Tyka M, Baker D. Modeling disordered regions in proteins using Rosetta. PLoS One 2011; 6:e22060. PMID:21829444; http://dx.doi.org/10.1371/journal.pone.0022060.
76. Rodrigues JP, Levitt M, Chopra G. KoBaMIN: a knowledge-based minimization web server for protein structure refinement. Nucleic Acids Res 2012; 40(Web Server issue):W323-8. PMID:22564897; http://dx.doi.org/10.1093/nar/gks376.
77. Shih-Chieh S, Cheng-Jian L, Chuan-Kang T. An effective hybrid of hill climbing and genetic algorithm for 2D triangular protein structure prediction. Proteome Science; 9.
78. Dill KA. Theory for the folding and stability of globular proteins. Biochemistry 1985; 24:1501-9. PMID:3986190; http://dx.doi.org/10.1021/bi00327a032.
79. Böckenhauer HJ, Dayem Ullah A, Kapsokalivas L, Steinhöfel K. A local move set for protein folding in triangular lattice models. Algorithms in Bioinformatics 2008:369-81.
80. Lin CJ, Su SC. Protein 3D HP model folding simulation using a hybrid of genetic algorithm and particle swarm optimization. International Journal of Fuzzy Systems 2011; 13:140-7.
81. Cotta C. Protein structure prediction using evolutionary algorithms hybridized with backtracking. Artificial Neural Nets Problem Solving Methods 2003:1044
82. Cutello V, Morelli G, Nicosia G, Pavone M. Immune algorithms with aging operators for the string folding problem and the protein folding problem. Evolutionary Computation in Combinatorial Optimization 2005:80-90.
83. de Almeida C, Gonçalves R, Delgado M. A hybrid immune-based system for the protein folding problem. Evolutionary Computation in Combinatorial Optimization 2007:13-24.
84. Jiang T, Cui Q, Shi G, Ma S. Protein folding simulations of the hydrophobic-hydrophilic model by combining tabu search with genetic algorithms. J Chem Phys 2003; 119:4592; http://dx.doi.org/10.1063/1.1592796.
85. Benitez CMV, Parpinelli RS, Lopes HS. Parallelism, hybridism and coevolution in a multi-level ABCGA approach for the protein structure prediction problem. Concurr Comput 2012; http://dx.doi.org/10.1002/cpe.1857.
86. Qu B, Wu Z. An efficient way of multiple sequence alignment. IEEE, 2011:442-5.
87. Cooper S, Khatib F, Treuille A, Barbero J, Lee J, Beenen M, et al. Predicting protein structures with a multiplayer online game. Nature 2010; 466:756-60. PMID:20686574; http://dx.doi.org/10.1038/nature09304.S