Abstract
Over the past few decades, metaheuristics methods have been applied to a large variety of bioinformatic applications. There is a growing interest in applying metaheuristics methods in the analysis of gene sequence and microarray data. Therefore, this review is intend to give a survey of some of the metaheuristics methods to analysis biological data such as gene sequence analysis, molecular 3D structure prediction, microarray analysis and multiple sequence alignment. The survey is accompanied by the presentation of the main algorithms belonging to three single solution based metaheuristics and three population based methods. These are followed by different applications along with their merits for addressing some of the mentioned tasks.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Ali, A.F., Hassanien, A.E.: Minimizing molecular potential energy function using genetic Nelder-Mead algorithm. In: 8th International Conference on Computer Engineering & Systems (ICCES), pp. 177–183 (2013)
Akhand, M.A.H., Junaed, A.B.M., Murase, K.: Group search optimization to solve traveling salesman problem. In: 15th ICCIT 2012, University of Chittagong, 22–24 Dec 2012
Bansal, J.C.: Shashi, Deep, K., Katiyar, V.K.: Minimization of molecular potential energy function using particle swarm optimization. Int. J. Appl. Math. Mech. 6(9), 1–9 (2010)
Barbosa, H.J.C., Lavor, C., Raupp, F.M.: A GA-simplex hybrid algorithm for global minimization of molecular potential energy function. Ann. Oper. Res. 138, 189–202 (2005)
Chelouah, R., Siarry, P.: Tabu search applied to global optimization. Eur. J. Oper. Res. 123, 256–270 (2000)
Deb, K., Joshi, D.: A computationally efficient evolutionary algorithm for real parameter optimization, Technical Report 003, KanGal (2002)
Deb, K., Agrawal, R.B.: Simulated binary crossover for continuous search space. Complex Syst. 9, 115–148 (1995)
Dra\(\breve{{{\rm z}}}\)i\(\acute{{{\rm c}}}\), M., Lavor, C., Maculan, N., Mladenovi\(\acute{{{\rm c}}}\), N.: A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule. Eur. J. Oper. Res. 185, 1265–1273 (2008)
Crainic, T.G., Toulouse, M.: Parallel strategies for metaheuristics. In: Glover, F.W., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 475–513. Springer (2003)
De Jong, K.A.: Genetic algorithms: a 10 year perspective. In: International Conference on Genetic Algorithms, pp. 169–177 (1985)
Dorigo, M.: Optimization, learning and natural algorithms, Ph.D. thesis, Politecnico di Milano, Italy (1992)
Fang, J.Y., Cui, Z.H., Cai, X.J., Zeng, J.C.: A Hybrid group search optimizer with metropolis rule, In: Proceedings of the 2010 International Conference on Modeling, Identification and Control (ICMIC), Okayama, Japan, pp. 556–561 (2010)
Farmer, J.D., Packard, N.H., Perelson, A.S.: The immune system, adaptation, and machine learning. Physica D 2, 187–204 (1986)
Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67–71 (1989)
Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Global Optim. 6, 109–133 (1995)
Furey, T., Cristianini, N., Duffy, N., Bednarski, D., Schummer, M., Haussler, D.: Support vector machine classification and validation of cancer tissue samples using microarray expression data. Bioformatics 16, 906–914 (2000)
Flynn, M.J.: Some computer organizations and their effectiveness. IEEE Trans. Comput. C-21, 948–960 (1972)
Gendreau, M., Potvin, J.Y.: Chapter 6: Tabu search. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies, pp. 165–186. Springer (2006)
Golub, T., Slonim, D., Tamayo, P., Huard, C., Gaasenbeek, M., Mesirov, J., Coller, H., Loh, M., Downing, J., Caligiuri, M., et al.: Molecular classification of cancer: class discovery and class prediction by gene expression monitoring. Science 286, 531–537 (1999)
Glover, F.: Parametric combinations of local job shop rules. In: ONR Research Memorandum, No. 117, GSIA, Carnegie Mellon University, Pittsburgh (1963)
Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13, 533–549 (1986)
Glover, F.: A template for scatter search and path relinking. Lect. Notes Comput. Sci. 1363, 13–54 (1997)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
He, S., Wu, Q.H., Saunders, J.R.: A novel group search optimizer inspired by animal behavioral ecology. In: Proceedings of 2006 IEEE Congress on Evolutionary Computation, Vancouver, BC: Sheraton Vancouver Wall Center, pp. 1272–1278, July (2006)
He, S., Wu, Q.H., Saunders, J.R.: Group search optimizer–an optimization algorithm inspired by animal searching behavior. IEEE Trans. Evol. Comput. 13(5), 973–990 (2009)
He, G.H., Cui, Z.H., Tan, Y.: Interactive dynamic neighborhood differential evolutionary group search optimizer. J. Chin. Comput. Syst. (accepted, 2011)
Hedar, A., Ali, A.F.: Tabu search with multi-level neighborhood structures for high dimensional problems. Appl. Intell. 37, 189–206 (2012)
Hedar, A., Ali, A.F., Hassan, T.: Genetic algorithm and tabu search based methods for molecular 3D-structure prediction. Int. J. Numer. Algebra, Control Optim. (NACO) (2011)
Hedar, A., Ali, A.F., Hassan, T.: Finding the 3D-structure of a molecule using genetic algorithm and tabu search methods. In: Proceeding of the 10th International Conference on Intelligent Systems Design and Applications (ISDA2010), Cairo, Egypt (2010)
Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. Proc. IEEE Int. Conf. Neural Netw. 4, 1942–1948 (1995)
Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Liu, C., Wang, L., Yang, A. (eds.): A Modified group search optimizer algorithm for high dimensional function optimization. In: ICICA, Part II, CCIS, vol. 308, pp. 219–226 (2012)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, New York (1992)
Michalewicz, Z., Nazhiyath, G., Michalewicz, M.: A note on usefulness of geometrical crossover for numerical optimization problems. In: 5th Annual Conference on Evolutionary Programming, San Diego, CA. MIT Press, pp. 305–312 (1996)
Mladenovic, N.: A variable neighborhood algorithm a new metaheuristic for combinatorial optimization. In: Abstracts of Papers Presented at Optimization Days, Montral, Canada, p. 112 (1995)
Mladenovic, M., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097–1100 (1997)
Peng, S.H., Xu, Q.H., Ling, X.B., Peng, X.N., Du, W., Chen, L.B.: Molecular classification of cancer types from microarray data using the combination of genetic algorithms and support vector machines. FEBS Lett. 555, 358–362 (2003)
Pogorelov, A.: Geometry. Mir Publishers, Moscow (1987)
Shen, Q., Wei-Min, S., Wei, K.: Hybrid particle swarm optimization and tabu search approach for selecting genes for tumor classification using gene expression data. Comput. Biol. Chem. 32, 53–60 (2008)
Sima, C., Dougherty, E.R.: What should be expected from feature selection in small-sample settings. Bioinformatics 22(19), 2430–2436 (2006)
Storn, R.M., Price, K.V.: Differential evolution a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11, 341–359 (1997)
Sttzle, T.: Local search algorithms for combinatorial problems: analysis, improvements, and new applications, Ph.D. thesis, Darmstadt University of Technology (1998)
Syswerda, G.: Uniform crossover in genetic algorithms. In: Schaffer, J.D. (ed.) Proceedings of the Third International Conference on Genetic Algorithms, pp. 2–9. Morgan Kaufmann Publishers, San Mateo (1989)
Tsutsui, S., Yamamura, M., Higuchi, T.: Multi-parent recombination with simplex crossover in real-coded genetic algorithms. In: GECCO99 Genetic and Evolutionary Computation Conference, pp. 657–664 (1999)
Voudouris, C.: Guided local search for combinatorial optimization problems, Ph.D thesis, University of Essex (1997)
Voudouris, C.: Guided local search: an illustrative example in function optimization. BT Technol. J. 16, 46–50 (1998)
Voudouris, C., Tsang, E.: Guided local search. Eur. J. Oper. Res. 113, 469–499 (1999)
Xiong, M., Li, W., Zhao, J., Jin, L., Boerwinkle, E.: Feature (gene) selection in gene expression-based tumor classification. Mol. Genet. Metab. 73, 239–247 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Ali, A.F., Hassanien, AE. (2016). A Survey of Metaheuristics Methods for Bioinformatics Applications. In: Hassanien, AE., Grosan, C., Fahmy Tolba, M. (eds) Applications of Intelligent Optimization in Biology and Medicine. Intelligent Systems Reference Library, vol 96. Springer, Cham. https://doi.org/10.1007/978-3-319-21212-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-21212-8_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21211-1
Online ISBN: 978-3-319-21212-8
eBook Packages: EngineeringEngineering (R0)