Skip to main content

A Survey of Metaheuristics Methods for Bioinformatics Applications

  • Chapter
  • First Online:

Part of the book series: Intelligent Systems Reference Library ((ISRL,volume 96))

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. 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)

    Google Scholar 

  2. 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

    Google Scholar 

  3. 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)

    Google Scholar 

  4. 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)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chelouah, R., Siarry, P.: Tabu search applied to global optimization. Eur. J. Oper. Res. 123, 256–270 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Deb, K., Joshi, D.: A computationally efficient evolutionary algorithm for real parameter optimization, Technical Report 003, KanGal (2002)

    Google Scholar 

  7. Deb, K., Agrawal, R.B.: Simulated binary crossover for continuous search space. Complex Syst. 9, 115–148 (1995)

    MathSciNet  MATH  Google Scholar 

  8. 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)

    Google Scholar 

  9. 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)

    Google Scholar 

  10. De Jong, K.A.: Genetic algorithms: a 10 year perspective. In: International Conference on Genetic Algorithms, pp. 169–177 (1985)

    Google Scholar 

  11. Dorigo, M.: Optimization, learning and natural algorithms, Ph.D. thesis, Politecnico di Milano, Italy (1992)

    Google Scholar 

  12. 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)

    Google Scholar 

  13. Farmer, J.D., Packard, N.H., Perelson, A.S.: The immune system, adaptation, and machine learning. Physica D 2, 187–204 (1986)

    Article  MathSciNet  Google Scholar 

  14. Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67–71 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  15. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Global Optim. 6, 109–133 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  16. 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)

    Article  Google Scholar 

  17. Flynn, M.J.: Some computer organizations and their effectiveness. IEEE Trans. Comput. C-21, 948–960 (1972)

    Google Scholar 

  18. Gendreau, M., Potvin, J.Y.: Chapter 6: Tabu search. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies, pp. 165–186. Springer (2006)

    Google Scholar 

  19. 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)

    Article  Google Scholar 

  20. Glover, F.: Parametric combinations of local job shop rules. In: ONR Research Memorandum, No. 117, GSIA, Carnegie Mellon University, Pittsburgh (1963)

    Google Scholar 

  21. Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13, 533–549 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  22. Glover, F.: A template for scatter search and path relinking. Lect. Notes Comput. Sci. 1363, 13–54 (1997)

    Google Scholar 

  23. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)

    Google Scholar 

  24. 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)

    Google Scholar 

  25. 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)

    Article  Google Scholar 

  26. He, G.H., Cui, Z.H., Tan, Y.: Interactive dynamic neighborhood differential evolutionary group search optimizer. J. Chin. Comput. Syst. (accepted, 2011)

    Google Scholar 

  27. Hedar, A., Ali, A.F.: Tabu search with multi-level neighborhood structures for high dimensional problems. Appl. Intell. 37, 189–206 (2012)

    Article  Google Scholar 

  28. 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)

    Google Scholar 

  29. 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)

    Google Scholar 

  30. Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  31. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. Proc. IEEE Int. Conf. Neural Netw. 4, 1942–1948 (1995)

    Article  Google Scholar 

  32. Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220, 671–680 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  33. 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)

    Google Scholar 

  34. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, New York (1992)

    Book  MATH  Google Scholar 

  35. 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)

    Google Scholar 

  36. 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)

    Google Scholar 

  37. Mladenovic, M., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  38. 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)

    Article  Google Scholar 

  39. Pogorelov, A.: Geometry. Mir Publishers, Moscow (1987)

    Google Scholar 

  40. 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)

    Article  MATH  Google Scholar 

  41. Sima, C., Dougherty, E.R.: What should be expected from feature selection in small-sample settings. Bioinformatics 22(19), 2430–2436 (2006)

    Article  Google Scholar 

  42. 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)

    Article  MathSciNet  MATH  Google Scholar 

  43. Sttzle, T.: Local search algorithms for combinatorial problems: analysis, improvements, and new applications, Ph.D. thesis, Darmstadt University of Technology (1998)

    Google Scholar 

  44. 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)

    Google Scholar 

  45. 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)

    Google Scholar 

  46. Voudouris, C.: Guided local search for combinatorial optimization problems, Ph.D thesis, University of Essex (1997)

    Google Scholar 

  47. Voudouris, C.: Guided local search: an illustrative example in function optimization. BT Technol. J. 16, 46–50 (1998)

    Article  Google Scholar 

  48. Voudouris, C., Tsang, E.: Guided local search. Eur. J. Oper. Res. 113, 469–499 (1999)

    Article  MATH  Google Scholar 

  49. 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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ahmed Fouad Ali .

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics