Skip to main content
Top
Published in: Neural Computing and Applications 7/2018

06-03-2018 | Original Article

A developed system based on nature-inspired algorithms for DNA motif finding process

Authors: Mai S. Mabrouk, Mohamed B. Abdelhalim, Ebtehal S. Elewa

Published in: Neural Computing and Applications | Issue 7/2018

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In this paper, recent algorithms are suggested to repair the issue of motif finding. The proposed algorithms are cuckoo search, modified cuckoo search and finally a hybrid of gravitational search and particle swarm optimization algorithm. Motif finding is the technique of handling expressive motifs successfully in huge DNA sequences. DNA motif finding is important because it acts as a significant function in understanding the approach of gene regulation. Recent results of existing motifs finding programs display low accuracy and can not be used to find motifs in different types of datasets. Practical tests are implemented first on synthetic datasets and then on benchmark real datasets that are based on nature-inspired algorithms. The results revealed that the hybridization of gravitational search algorithm and particle swarm algorithms provides higher precision and recall values and provides average enhancement of F-score up to 0.24, compared to other existing algorithms and tools, and also that cuckoo search and modified cuckoo search have been able to successfully locate motifs in DNA sequences.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Das Mk and Dai HK (2007) A survey of DNA motif finding algorithms. BMC Bioinfor 18(7):1 Das Mk and Dai HK (2007) A survey of DNA motif finding algorithms. BMC Bioinfor 18(7):1
2.
go back to reference Wei W, Yu X-D (2007) Comparative analysis of regulatory motif discovery tools for transcription factor binding sites. Genom Proteom Bioinform 5(2):131–142MathSciNetCrossRef Wei W, Yu X-D (2007) Comparative analysis of regulatory motif discovery tools for transcription factor binding sites. Genom Proteom Bioinform 5(2):131–142MathSciNetCrossRef
3.
go back to reference Li N, Tompa M (2006) Analysis of computational approaches for motif discovery. Algorithms Mol Biol 1(1):1CrossRef Li N, Tompa M (2006) Analysis of computational approaches for motif discovery. Algorithms Mol Biol 1(1):1CrossRef
4.
5.
go back to reference Karaboga D et al (2014) A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif Intell Rev 42(1):21–57CrossRef Karaboga D et al (2014) A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif Intell Rev 42(1):21–57CrossRef
6.
go back to reference Dadhich A et al (2014) Swarm intelligence based linear cryptanalysis of four-round data encryption standard algorithm. In: 2014 International conference on issues and challenges in intelligent computing techniques (ICICT) Dadhich A et al (2014) Swarm intelligence based linear cryptanalysis of four-round data encryption standard algorithm. In: 2014 International conference on issues and challenges in intelligent computing techniques (ICICT)
7.
go back to reference D’haeseleer P (2006) What are DNA sequence motifs? Nat Biotechnol 24(4):423–425CrossRef D’haeseleer P (2006) What are DNA sequence motifs? Nat Biotechnol 24(4):423–425CrossRef
9.
go back to reference Chawla M, Duhan M (2014) Applications of recent metaheuristics optimisation algorithms in biomedical engineering: a review. Int J Biomed Eng Technol 16(3):268–278CrossRef Chawla M, Duhan M (2014) Applications of recent metaheuristics optimisation algorithms in biomedical engineering: a review. Int J Biomed Eng Technol 16(3):268–278CrossRef
10.
go back to reference Ding J, Liu J, Chowdhury KR, Zhang W, Hu Q, Lei J (2014) A particle swarm optimization using local stochastic search and enhancing diversity for continuous optimization. Neurocomputing 137:261–267CrossRef Ding J, Liu J, Chowdhury KR, Zhang W, Hu Q, Lei J (2014) A particle swarm optimization using local stochastic search and enhancing diversity for continuous optimization. Neurocomputing 137:261–267CrossRef
11.
go back to reference Gong M-G, Cai Q, Chen X-W, Ma L-J (2014) Complex network clustering by multiobjective discrete particle swarm optimization based on decomposition. In: IEEE Transactions on evolutionary computation vol 18(1), pp. 82–97CrossRef Gong M-G, Cai Q, Chen X-W, Ma L-J (2014) Complex network clustering by multiobjective discrete particle swarm optimization based on decomposition. In: IEEE Transactions on evolutionary computation vol 18(1), pp. 82–97CrossRef
12.
go back to reference Ouaaraba A, Ahioda B, Yang XS (2014) Discrete cuckoo search algorithm for the travelling salesman problem. Neural Comput Appl 24(7–8):1659–1669CrossRef Ouaaraba A, Ahioda B, Yang XS (2014) Discrete cuckoo search algorithm for the travelling salesman problem. Neural Comput Appl 24(7–8):1659–1669CrossRef
13.
go back to reference Hamdy M et al (2006) BIOINFTool: Bioinformatics and sequence data analysis in molecular biology using Matlab, Cairo Hamdy M et al (2006) BIOINFTool: Bioinformatics and sequence data analysis in molecular biology using Matlab, Cairo
14.
go back to reference Eskin E, Pevzner PA (2002) Finding composite regulatory patterns in DNA sequences. Bioinformatics 18:S354–S363CrossRef Eskin E, Pevzner PA (2002) Finding composite regulatory patterns in DNA sequences. Bioinformatics 18:S354–S363CrossRef
15.
go back to reference Regnier M, Denis A (2004) Rare events and conditional events on random strings. Discrete Math Theor C 6:191–214MathSciNetMATH Regnier M, Denis A (2004) Rare events and conditional events on random strings. Discrete Math Theor C 6:191–214MathSciNetMATH
16.
go back to reference Sinha S, Tompa M (2003) YMF: a program for discovery of novel transcription factor binding sites by statistical overrepresentation. Nucleic Acids Res 31(13):3586–3588CrossRef Sinha S, Tompa M (2003) YMF: a program for discovery of novel transcription factor binding sites by statistical overrepresentation. Nucleic Acids Res 31(13):3586–3588CrossRef
17.
go back to reference Mauri G, Pesole G (2004) Weeder Web: discovery of transcription factor binding sites in a set of sequences from co-regulated genes. Nucleic Acids Res 32:W199–W203CrossRef Mauri G, Pesole G (2004) Weeder Web: discovery of transcription factor binding sites in a set of sequences from co-regulated genes. Nucleic Acids Res 32:W199–W203CrossRef
19.
go back to reference Bailey TL, Elkan C (1995) Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Machine Learn 21(1–2):51–80 Bailey TL, Elkan C (1995) Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Machine Learn 21(1–2):51–80
20.
go back to reference Roth FP et al (1998) Finding DNA regulatory motifs within unaligned noncoding sequences clustered by whole-genome mRNA quantitation. Nature biotechnology, nature publishing, US, vol 16, pp 939–945 Roth FP et al (1998) Finding DNA regulatory motifs within unaligned noncoding sequences clustered by whole-genome mRNA quantitation. Nature biotechnology, nature publishing, US, vol 16, pp 939–945
21.
go back to reference Vijayvargiya S, Shukla P (2011) Identification of transcription factor binding sites in biological sequences using genetic algorithm. Int J Res Rev Comput Sci 2(2):14 Vijayvargiya S, Shukla P (2011) Identification of transcription factor binding sites in biological sequences using genetic algorithm. Int J Res Rev Comput Sci 2(2):14
22.
go back to reference Gutierrez JB et al (2015) A genetic algorithm for motif finding based on statistical significance. In: International conference on bioinformatics and biomedical engineering Gutierrez JB et al (2015) A genetic algorithm for motif finding based on statistical significance. In: International conference on bioinformatics and biomedical engineering
23.
go back to reference Reddy US et al (2013) A particle swarm optimization solution for challenging planted(l, d)-Motif problem Reddy US et al (2013) A particle swarm optimization solution for challenging planted(l, d)-Motif problem
24.
go back to reference Lei C, Ruan J (2010) A particle swarm optimization-based algorithm for finding gapped motifs. BioData Min 3(9):1 Lei C, Ruan J (2010) A particle swarm optimization-based algorithm for finding gapped motifs. BioData Min 3(9):1
25.
go back to reference Hu J (2005) Limitations and potentials of current motif discovery algorithms. Nucleic Acids Res 33(15):4899–4913CrossRef Hu J (2005) Limitations and potentials of current motif discovery algorithms. Nucleic Acids Res 33(15):4899–4913CrossRef
26.
go back to reference Yang. XS, Deb S (2009) Cuckoo search via Lévy flights. In IEEE Yang. XS, Deb S (2009) Cuckoo search via Lévy flights. In IEEE
27.
go back to reference Bhargava V (2013) Cuckoo search: a new nature-inspired optimization method for phase equilibrium calculations. Fluid Phase Equilibria 337:191–200CrossRef Bhargava V (2013) Cuckoo search: a new nature-inspired optimization method for phase equilibrium calculations. Fluid Phase Equilibria 337:191–200CrossRef
28.
go back to reference Brajevic I et al (2012) Multilevel image thresholding selection based on the cuckoo search algorithm Brajevic I et al (2012) Multilevel image thresholding selection based on the cuckoo search algorithm
29.
go back to reference Chandrasekaran K, Simon SP (2012) Multi-objective scheduling problem: Hybrid approach using fuzzy assisted cuckoo search algorithm. Swarm and Evolutionary Computation 5:1–16CrossRef Chandrasekaran K, Simon SP (2012) Multi-objective scheduling problem: Hybrid approach using fuzzy assisted cuckoo search algorithm. Swarm and Evolutionary Computation 5:1–16CrossRef
30.
go back to reference Bulatović R (2013) Cuckoo search algorithm: a metaheuristic approach to solving the problem of optimum synthesis of a six-bar double dwell linkage. Mech Mach Theory 61:1–13CrossRef Bulatović R (2013) Cuckoo search algorithm: a metaheuristic approach to solving the problem of optimum synthesis of a six-bar double dwell linkage. Mech Mach Theory 61:1–13CrossRef
31.
go back to reference Civicioglu P, Besdok E (2013) A conceptual comparison of the Cuckoo-search, particle swarm optimization, differential evolution and artificial bee colony algorithms. Artif Intell Rev 39(4):315–346CrossRef Civicioglu P, Besdok E (2013) A conceptual comparison of the Cuckoo-search, particle swarm optimization, differential evolution and artificial bee colony algorithms. Artif Intell Rev 39(4):315–346CrossRef
32.
go back to reference Guerrero M (2015) Cuckoo search via Lévy flights and a comparison with genetic algorithms, fuzzy logic augmentation of nature-inspired optimization. Metaheuristics Studies Comput Intell 574:91–103 Guerrero M (2015) Cuckoo search via Lévy flights and a comparison with genetic algorithms, fuzzy logic augmentation of nature-inspired optimization. Metaheuristics Studies Comput Intell 574:91–103
33.
go back to reference Zheng H, Zhou Y (2012) A novel cuckoo search optimization algorithm based on gauss distribution. J Comput Inf Syst 8:4193–4200 Zheng H, Zhou Y (2012) A novel cuckoo search optimization algorithm based on gauss distribution. J Comput Inf Syst 8:4193–4200
34.
go back to reference Khan K, Sahai A (2013) Neural-based cuckoo search of employee health and safety(hs). Int J Intell Syst Appl (IJISA) 5(2):76–83 Khan K, Sahai A (2013) Neural-based cuckoo search of employee health and safety(hs). Int J Intell Syst Appl (IJISA) 5(2):76–83
35.
go back to reference Zhang Y (2012) Modifed adaptive cuckoo search (macs) algorithm and formal description for global optimisation. Int J Comput Appl Technol 44(2):73–79CrossRef Zhang Y (2012) Modifed adaptive cuckoo search (macs) algorithm and formal description for global optimisation. Int J Comput Appl Technol 44(2):73–79CrossRef
36.
go back to reference Yang XS, Deb S (2010) Engineering optimization by cuckoo search. Int J Math Model Numer Optim 1(4):330–343MATH Yang XS, Deb S (2010) Engineering optimization by cuckoo search. Int J Math Model Numer Optim 1(4):330–343MATH
37.
go back to reference Kennedy J (1995) Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Perth, Australia, pp 1942–1948 Kennedy J (1995) Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Perth, Australia, pp 1942–1948
38.
go back to reference Eberhart R, Kennedy JA (1995) new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science, Nagoya, Japan, p 39–43 Eberhart R, Kennedy JA (1995) new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science, Nagoya, Japan, p 39–43
39.
go back to reference Clerc M (2001) Discrete particle swarm optimization Clerc M (2001) Discrete particle swarm optimization
40.
go back to reference Agrafiotis DK, Cedeno W (2002) Feature selection for structure-activity correlation using binary particle swarms. J Med Chem 45:1098–1107CrossRef Agrafiotis DK, Cedeno W (2002) Feature selection for structure-activity correlation using binary particle swarms. J Med Chem 45:1098–1107CrossRef
41.
go back to reference Tawab AMA (2014) Efficient Multi-feature PSO for Fast Gray level object-tracking. Appl Soft Comput Elsevier 14:317–337CrossRef Tawab AMA (2014) Efficient Multi-feature PSO for Fast Gray level object-tracking. Appl Soft Comput Elsevier 14:317–337CrossRef
42.
go back to reference Abdelhalim MB, Habib SD (2009) Particle swarm optimization for HW/SW partitioning. In: Lazinica A (Ed) Particle Swarm Optimization. Tech Education and Publishing, pp 49–76 Abdelhalim MB, Habib SD (2009) Particle swarm optimization for HW/SW partitioning. In: Lazinica A (Ed) Particle Swarm Optimization. Tech Education and Publishing, pp 49–76
43.
go back to reference Rashedi E (2009) GSA A Gravitational Search Algorithm. Inf Sci 179(13):2232–2248CrossRef Rashedi E (2009) GSA A Gravitational Search Algorithm. Inf Sci 179(13):2232–2248CrossRef
44.
go back to reference Sinaie S (2010) Solving shortest path problem using gravitational search algorithm and neural networks Sinaie S (2010) Solving shortest path problem using gravitational search algorithm and neural networks
45.
go back to reference Zhang Y (2012) Immune gravitation inspired optimization algorithm advanced intelligent computing. In: Huang D-S, Gan Y, Bevilacqua V, Figueroa J (eds). Springer, Berlin/Heidelberg, vol 6838, pp 178–185 Zhang Y (2012) Immune gravitation inspired optimization algorithm advanced intelligent computing. In: Huang D-S, Gan Y, Bevilacqua V, Figueroa J (eds). Springer, Berlin/Heidelberg, vol 6838, pp 178–185
46.
go back to reference Adami C (2004) Information theory in molecular biology. Phys Life Rev 1:3–22CrossRef Adami C (2004) Information theory in molecular biology. Phys Life Rev 1:3–22CrossRef
47.
go back to reference Pevzner PA, Sze SH (2006) Combinatorial approaches to finding subtle signals in DNA sequences Pevzner PA, Sze SH (2006) Combinatorial approaches to finding subtle signals in DNA sequences
48.
go back to reference Favorov AV, Frith MC, Fu Y, Kent WJ et al (2005) Assessing computational tools for the discovery of transcription factor binding sites. Nat. Biotechnol 23:137–144CrossRef Favorov AV, Frith MC, Fu Y, Kent WJ et al (2005) Assessing computational tools for the discovery of transcription factor binding sites. Nat. Biotechnol 23:137–144CrossRef
49.
go back to reference Chan TM (2007) TFBS identification by position and consensus-led genetic algorithm with local filtering. In: GECCO’07: proceedings of the 2007 conference on genetic and evolutionary computation. ACM, London, England Chan TM (2007) TFBS identification by position and consensus-led genetic algorithm with local filtering. In: GECCO’07: proceedings of the 2007 conference on genetic and evolutionary computation. ACM, London, England
50.
go back to reference Mirjalili S, Hashim SZM (2010) A new hybrid PSOGSA algorithm for function optimization. In: 2010 international conference on computer and information application (ICCIA), Tianjin, China Mirjalili S, Hashim SZM (2010) A new hybrid PSOGSA algorithm for function optimization. In: 2010 international conference on computer and information application (ICCIA), Tianjin, China
Metadata
Title
A developed system based on nature-inspired algorithms for DNA motif finding process
Authors
Mai S. Mabrouk
Mohamed B. Abdelhalim
Ebtehal S. Elewa
Publication date
06-03-2018
Publisher
Springer London
Published in
Neural Computing and Applications / Issue 7/2018
Print ISSN: 0941-0643
Electronic ISSN: 1433-3058
DOI
https://doi.org/10.1007/s00521-018-3398-0

Other articles of this Issue 7/2018

Neural Computing and Applications 7/2018 Go to the issue

Premium Partner