Skip to main content
SpringerLink
Log in

Genetic Algorithm-Based Motif Search Problem: A Review

  • Conference paper
  • First Online:
Smart Intelligent Computing and Applications

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 159))

Abstract

In bioinformatics, the amelioration of adequate computational algorithms for motif discovery is one of the biggest challenges. In the current genomic age, the potentiality to address the behavioural, functional and structural aspect of motifs plays a crucial role in the understanding of different biological mechanisms. This paper attempts to review and explore the use of evolutionary algorithms particularly the genetic algorithm used by the researchers in the past decade towards the search for motifs in biological sequences. This review focuses on the conventional genetic algorithm-based approach to motif search and analyses the latest advancement in this domain. Author feels this study will be very helpful for the researchers specially working on the genetic algorithm-based motif search problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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

Institutional subscriptions

References

  1. Pradhan, M.: Motif Discovery in Biological Sequences. Master’s Projects. Paper 106. http://scholarworks.sjsu.edu/etd_projects/106 (2008)

  2. Rajasekaran, S.: Algorithms for Motif Search. University of Connecticut, CRC Press, www.engr.uconn.edu/~rajasek/bc16.pdf, (2001)

  3. Chauhan, R., Agarwal, P.: A review applying genetic algorithm for motif discovery. Int. J. Comput. Technol. Appl. 3(4), 1510–1515 (2012)

    Google Scholar 

  4. Falcon, F.L., Jeffrey, J.P., Tsai, R.C., Chen S.N., Shih, S.H.: FMGA: finding motifs by genetic algorithm. In: Bioinformatics and Bio-engineering. Bioinformatics and Bioengineering (BIBE) Proceedings Fourth IEEE Symposium, pp. 459–466, (2004)

    Google Scholar 

  5. Thijs, G., et al.: A higher-order background model improves the detection of promoter regulatory elements by Gibbs sampling. Bioinformatics 17(12), 1113–1122 (2001)

    Article  Google Scholar 

  6. Bailey, T.L., Elkan, C.: Fitting a mixture model by expectation maximization to discover motifs in biopolymers. In: Proceeding of Second International Conference on Intelligent Systems for Molecular Biology, AAAI Press, pp. 28–36, (1994)

    Google Scholar 

  7. Dongsheng, C., Yinglei, S., Khaled, R.: MDGA: Motif Discovery Using A Genetic Algorithm. Department of Computer Science, University of Georgia, Athens, GA (2005)

    Google Scholar 

  8. Garner, M., Revzin, A.: A gel electrophoresis method for quantifying the binding of proteins to specific DNA regions: application to components of the Escherichia coli lactose operon regulatory system. Nucleic Acids Res. 9(13), 3047–3060 (1981)

    Article  Google Scholar 

  9. Galas, D.J., Schmitz, A.: DNAse footprinting: a simple method for the detection of protein-DNA binding specificity. Nucleic Acids Res. 5(9), 3157–3170 (1978)

    Article  Google Scholar 

  10. Wei, Z., Jensen, S.T.: GAME: detecting cis-regulatory elements using a genetic algorithm. Bioinformatics 22(13), 1577–1584 (2006)

    Article  Google Scholar 

  11. Sinha, S., Blanchette, M., Tompa, M.: PhyME: a probabilistic algorithm for finding motifs in sets of orthologous sequences. BMC Bioinf. 5(170), 11–14 (2004)

    Google Scholar 

  12. Chengpeng, B.: A genetic-based EM motif finding algorithm for biological sequence analysis. In: Computational Intelligence and Bioinformatics and Computational Biology (CIBCB’07) IEEE Symposium, pp. 275–282 (2007)

    Google Scholar 

  13. Michal, S., Ivry, T., Schalit-Cohen, O., Sipper, M., Barash, D.: Finding a common Motif of RNA sequences using genetic programming: the GeRNAMo system. IEEE/ACM Trans. Comput. Biol. Bioinf. 4(4) (2007)

    Article  Google Scholar 

  14. Karaoglu, N., Maurer-Stroh, S., Manderick, B.: GAMOT: an efficient genetic algo-rithm for finding challenging motifs in DNA sequences. In: Book: Regulatory Genomics: Proceedings of the 3rd Annual RECOMB Workshop, pp. 43–55, (2008)

    Google Scholar 

  15. Kaya, M.: MOGAMOD: multi-objective genetic algorithm for motif discovery. Expert Syst. Appl. 36(2), 1039–1047 (2009)

    Article  Google Scholar 

  16. Deb, K., Pratap, A., Agarwal, S.: A fast and elitist multi-objective genetic algorithm: NSGA II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)

    Article  Google Scholar 

  17. Huo, H., Zhao, Z., Stojkovic, V., Liu, L.: Optimizing genetic algorithm for motif dis-covery. Math. Comput. Model. 52(11), 2011–2020 (2010)

    Article  Google Scholar 

  18. Le, T., Altman, T., Gardiner, K.: HIGEDA: a hierarchical gene-set genetics based algorithm for finding subtle motifs in biological sequences. Bioinformatics 26(3), 302–309 (2010)

    Article  Google Scholar 

  19. Wang, X., Miao, Y.: GAEM: a hybrid algorithm incorporating GA with EM for planted edited Motif finding problem. Artic. Curr. Bioinf. (2014)

    Google Scholar 

  20. Fan, Y., Wu, W., Yang, J., Yang, W., Liu, R.: An algorithm for motif discovery with iteration on lengths of motifs. IEEE/ACM Trans. Comput. Biol. Bioinf. 12(1)136–141 (2015)

    Google Scholar 

  21. Serrà, J., Matić, A., Lluis, J., Karatzoglou, A.: A genetic algorithm to discover flexible Motifs with support. In: IEEExplore (2016)

    Google Scholar 

  22. Feng, S., Yang, Z., Huang, M.: Predicting DNA Motifs by using multi-objective hybrid adaptive biogeography-based optimization. Inf. Open Access J. Inf. Sci. 8(4), 1–20 (2017)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Engineering, KIIT University, Bhubaneswar, India

    Satarupa Mohanty & Suneeta Mohanty

Authors
  1. Satarupa Mohanty
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Suneeta Mohanty
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Satarupa Mohanty .

Editor information

Editors and Affiliations

  1. School of Computer Engineering, KIIT Deemed to be University, Bhubaneswar, Odisha, India

    Suresh Chandra Satapathy

  2. Department of Electronics and Communication Engineering, Shri Ramswaroop Memorial Group of Professional Colleges, Lucknow, Uttar Pradesh, India

    Vikrant Bhateja

  3. School of Computer Applications, KIIT University, Bhubaneswar, Odisha, India

    J. R. Mohanty

  4. School of Computer and Information Science, University of Hyderabad, Hyderabad, Telangana, India

    Siba K. Udgata

Appendix

Appendix

See Table 1.

Table 1 List of Motif discovery algorithms based on an evolutionary approach
Full size table

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mohanty, S., Mohanty, S. (2020). Genetic Algorithm-Based Motif Search Problem: A Review. In: Satapathy, S., Bhateja, V., Mohanty, J., Udgata, S. (eds) Smart Intelligent Computing and Applications . Smart Innovation, Systems and Technologies, vol 159. Springer, Singapore. https://doi.org/10.1007/978-981-13-9282-5_69

Download citation

Publish with us

Policies and ethics

Search

Navigation