Skip to main content
SpringerLink
Log in

Discovering Mutated Motifs in DNA Sequences: A Comparative Analysis

  • Conference paper
  • First Online:
Proceedings of International Conference on Artificial Intelligence and Applications

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1164))

  • 986 Accesses

Abstract

Locating motifs in DNA sequences is a traditional conjunctional and challenging problem in the discipline of bioinformatics. Motif refers to the biologically functional short, recurring common sequence pattern in DNA strands involved in important processes taking place at the genetic level in an organism. Motifs are the small set of immunity genes present in the DNA sequences as a binding site and turn on whenever the organism gets infected. Motif discovery is integral to problems such as antibody biomarker identification and transcription factor binding sites (TBFS) in the field of genetics and holds greater importance to enable advances in understanding human genetics, social intelligence, biology and health. This problem has been broadly studied over the years, but the complexity and optimality of most of the existing algorithms are still very high. Recently, this field of bioinformatics has grown significantly, and many algorithms have been proposed to solve this problem. However, high complexity is the most challenging aspect of this problem which still grabs the attention of many researchers. This paper analyzes the several algorithms mainly on the basis of their computing models and optimality of the solution and presents the critical reviews of the methods adopted for finding the planted motif. These algorithms can also be used for string matching, data mining and pattern detection, etc.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight 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. S. Prado, Motif discovery using optimized suffix tries. Master thesis, Faculty of Engineering and Architecture, Department of Information Technology—IBCN, Ghent University, Ghent, Belgium (2012)

    Google Scholar 

  2. H. Liu, F. Han, H. Zhou, X. Yan, K.S. Kosik, Fast motif discovery in short sequences, in 2016 IEEE 32nd International Conference on Data Engineering (ICDE), Helsinki (2016), pp. 1158–1169. https://doi.org/10.1109/icde.2016.7498321

  3. Q. Yu, H. Huo, X. Chen, H. Guo, An efficient motif finding algorithm for large DNA data sets, in 2014 IEEE International Conference on Bioinformatics and Biomedicine 2014

    Google Scholar 

  4. Y. Fana, W. Wua, R. Liua, W. Yangb, An iterative algorithm for motif discovery, in 17th Asia Pacific Symposium on Intelligent and Evolutionary Systems, IES2013

    Google Scholar 

  5. J.B. Gutierrez, K. Nakai, A study on the application of topic models to motif-finding algorithms, in From 15th International Conference on Bioinformatics, Queenstown, Singapore (2016)

    Google Scholar 

  6. Y. Zhang, P. Wang, A fast cluster motif finding algorithm for ChIP-Seq data sets. Biomed. Res. Int. 2015, 1–10 (2015). https://doi.org/10.1155/2015/218068

    Article  Google Scholar 

  7. I. Roy, S. Aluru, Discovering motifs in biological sequence using micron automata processor, in Conference Paper in IEEE/ACM Transactions on Computational Biology and Bioinformatics, Jan 2016

    Google Scholar 

  8. M.K. Das, H.K. Dai, A survey of DNA motif finding algorithms, in Proceedings of the Fourth Annual MCBIOS Conference. Computational Frontiers in Biomedicine, Nov 2007

    Google Scholar 

  9. S. Prakash, H. Agarwal, U. Agarwal, P. Biswas, S. Dawn, Discovering motifs in DNA sequences: a suffix tree based approach, in 8th International Advance Computing Conference (IACC 2018)

    Google Scholar 

  10. S. Rajasekaran, H. Dinh, A speed-up technique for (l, d)- motif-finding algorithms. BMC Res. Notes 4, 54 (2011)

    Article  Google Scholar 

  11. H.C.M. Leung, F.Y.L. Chin, An efficient motif discovery algorithm with unknown motif length and a number of binding sites. Int. J. Data Min. Bioinform. 1(2), 201 (2006). https://doi.org/10.1504/ijdmb.2006.0108562006

    Article  Google Scholar 

  12. A. Majumdar, Finding DNA motifs: a probabilistic suffix tree approach. Ph.D. dissertation, Computer Science and Engineering, Graduate College, University of Nebraska, Lincoln, 2016. Accessed 18 Apr 2018

    Google Scholar 

  13. H.R. Hassanzadeh, P. Kolhe, C.L. Isbell, M.D. Wang, MotifMark: finding regulatory motifs in DNA sequences, in 2017 39th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC), Seogwipo (2017), pp. 3890–3893. https://doi.org/10.1109/embc.2017.8037706

  14. J.S. Fink, M. Verhave, S. Kasper, T. Tsukada, G. Mandel, R.H. Goodman, The CGTCA sequence motif is essential for biological activity of the vasoactive intestinal peptide gene AMP-regulated enhancer. Proc. Natl. Acad. Sci. U.S.A. 85(18), 6662–6666 (1988)

    Article  Google Scholar 

  15. A. Jain, R. Parashar, A. Goyal, P. Biswas, S. Dawn, A. Nanda, Discovering motifs in DNa sequences: a candidate motifs based approach, in IEEE 5th International Conference on Parallel, Distributed and Grid Computing, Solan, India (2018)

    Google Scholar 

  16. U. Draisbach, F. Naumann, A generalization of blocking and windowing algorithms for duplicate detection, in 2011 International Conference on Data and Knowledge Engineering (ICDKE) (IEEE, 2011), pp. 18–24

    Google Scholar 

  17. P. Pevzner, N.C. Jones, An Introduction to Bioinformatics Algorithms (The MIT Press, Cambridge, MA, 2004)

    Google Scholar 

  18. F. Zambelli, G. Pesole, G. Pavesi, Motif discovery and transcription factor binding sites before and after the next-generation sequencing era. Brief. Bioinform. 14(2), 225–237 (2013)

    Article  Google Scholar 

  19. C. Angkawidjaja, A. Paul, Y. Koga, K. Takano, S. Kanaya, Importance of a repetitive nine-residue sequence motif for intracellular stability and functional structure of a family I.3 lipase. FEBS Lett. 579(21), 4707–4712 (2005)

    Article  Google Scholar 

  20. J.T. Ballew, J.A. Murray, P. Collin, M. Mäki, M.F. Kagnoff, K. Kaukinen, P.S. Daugherty, Antibody biomarker discovery through in vitro directed evolution of consensus recognition epitopes. Proc. Natl. Acad. Sci. 110(48), 19330–19335 (2013)

    Article  Google Scholar 

  21. J. Davila, S. Balla, S. Rajasekaran, Fast and practical algorithms for planted (l, d) motif search. IEEE/ACM Trans. Comput. Biol. Bioinform. 4, 544–552 (2007)

    Article  Google Scholar 

  22. T.L. Bailey, C. Elkan, Fitting a mixture model by expectation maximization to discover motifs in bipolymers, in Proceedings of 2nd International Conference on Intelligent System for Molecular Biology, Menlo Park, California (1994), pp. 28–36

    Google Scholar 

  23. C.E. Lawrence, S.F. Altschul, M.S. Boguski, J.S. Liu, A.F. Neuwald, J.C. Wootton, Detecting subtle sequence signals: A Gibbs sampling strategy for multiple alignment. Sc. 262, 208–214 (1993)

    Google Scholar 

  24. U. Keich, P.A. Pevzner, Finding motifs in the twilight zone, in Proceedings of 6th Annual International Conference on Computational Biology (2002), pp. 195–204

    Google Scholar 

  25. A. Price, S. Ramabhadran, P.A. Pevzner, Finding subtle motifs by branching from sample strings. Bioinformatics 19(suppl 2), ii149–ii155 (2003)

    Article  Google Scholar 

  26. A.M. Carvalho, A.T. Freitas, A.L. Oliveira, M.-F. Sagot, Highly scalable algorithm for the extraction of cis-regulatory regions, in Proceedings of Asia-Pacific Bioinformatics Conference (2005), pp. 273–283

    Google Scholar 

  27. P.A. Evans, A.D. Smith, Toward optimal motif enumeration, in Algorithms anRd Data Structures (Springer, New York, NY, USA, 2003), pp. 47–58

    Google Scholar 

  28. L. Marsan, M.F. Sagot, Extracting structured motifs using a suffix tree-Algorithms and application to promoter consensus identification, in Proceedings of 4th Annual International Conference on Computational Molecular Biology (2000), pp. 210–219

    Google Scholar 

  29. M. Nicolae, S. Rajasekaran, Efficient sequential and parallel algorithms for planted motif search (2013). arXiv preprint arXiv:1307.0571

  30. N. Sharma, M. Goel, A. Verma, A. Jain, R. Parashar, P. Biswas, Discovering non-mutated motifs in DNA sequences: a HashMap based binary search motif finder, 4th International Conference on Computing Communication and Automation 2018, Galgotias University, India, 14–15 Dec 2018

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science Engineering, Jaypee Institute of Information Technology, Noida, India

    Rajat Parashar, Mansi Goel, Nikitasha Sharma, Abhinav Jain, Adwitiya Sinha & Prantik Biswas

Authors
  1. Rajat Parashar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mansi Goel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nikitasha Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Abhinav Jain
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Adwitiya Sinha
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Prantik Biswas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rajat Parashar .

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Maharaja Surajmal Institute of Technology, New Delhi, India

    Poonam Bansal

  2. Department of Electrical and Electronics Engineering, Maharaja Surajmal Institute of Technology, New Delhi, India

    Meena Tushir

  3. Department of Automation and Applied Software, Aurel Vlaicu University of Arad, Arad, Romania

    Valentina Emilia Balas

  4. Department of Computer Science and Engineering, Indian Institute of Technology (BHU), Varanasi, India

    Rajeev Srivastava

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Parashar, R., Goel, M., Sharma, N., Jain, A., Sinha, A., Biswas, P. (2021). Discovering Mutated Motifs in DNA Sequences: A Comparative Analysis. In: Bansal, P., Tushir, M., Balas, V., Srivastava, R. (eds) Proceedings of International Conference on Artificial Intelligence and Applications. Advances in Intelligent Systems and Computing, vol 1164. Springer, Singapore. https://doi.org/10.1007/978-981-15-4992-2_25

Download citation

Publish with us

Policies and ethics

Search

Navigation