Advertisement

An Identical String Motif Finding Algorithm Through Dynamic Programming

  • Abdelmenem S. ElgabryEmail author
  • Tahani M. AllamEmail author
  • Mahmoud M. FahmyEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1005)

Abstract

Gene expression regulation is a major challenge in biology. One aspect of such a challenge is the binding sites in DNA, called motifs. DNA motif finding still poses a great challenge for computer scientists and biologists. As a result, a large number of motif finding algorithms are already implemented. However, literature has proven this task to be complex. The present paper tends to find a solution for the motif finding problem through rearranging data in a manner that can help obtain the targeted motif easily by adopting the dynamic programming concept. It proposes an efficient algorithm called Pattern Position Motif Finding (PPMF), aiming at finding all identical string motifs, which appear in a single sequence or multi sequences at least twice or a specified times. The proposed algorithm is compared with the Encoded Expansion (EE) algorithm to evaluate the execution time and size of processed sequences, PPMF takes less execution time than the corresponding one and processed large size sequences than EE processed. This denotes that when the biologist needs to find the identical string motifs in a big sequence, our proposed algorithm will be the better solution than the EE algorithm.

Keywords

Identical string motifs Gene expression regulation DNA motifs Nucleotide and protein sequences Sequence analysis 

References

  1. 1.
    Rombauts, S., Déhais, P., Van Montagu, M., Rouzé, P.: PlantCARE, a plant cis-acting regulatory element database. Nucleic Acids Res. 27(1), 295–296 (1999)CrossRefGoogle Scholar
  2. 2.
    D’haeseleer, P.: What are DNA sequence motifs? Nat. Biotechnol. 24, 423–425 (2006)CrossRefGoogle Scholar
  3. 3.
    Kaya, M.: Multi-objective genetic algorithm for motif discovery. Expert Syst. Appl. 36(2), 1039–1047 (2009)CrossRefGoogle Scholar
  4. 4.
    Das, M.K., Dai, H.-K.: A survey of DNA motif finding algorithms. BMC Bioinform. 8(7), S21 (2007).  https://doi.org/10.1186/1471-2105-8-S7-S21CrossRefGoogle Scholar
  5. 5.
    Karci, A.: Efficient automatic exact motif discovery algorithms for biological sequences. Expert Syst. Appl. 36(4), 7952–7963 (2009)CrossRefGoogle Scholar
  6. 6.
    Al-Ssulami, A., Azmi, A.M.: Towards a more efficient discovery of biologically significant DNA motifs. In: Ortuño, F., Rojas, I. (eds.) Bioinformatics and Biomedical Engineering, pp. 368–378. Springer, Cham (2015)Google Scholar
  7. 7.
    Azmi, A.M., Al-Ssulami, A.: Encoded expansion: an efficient algorithm to discover identical string motifs. PLoS ONE 9(5), e95148 (2014)CrossRefGoogle Scholar
  8. 8.
  9. 9.
    Wingender, E., Dietze, P., Karas, H., Knüppel, R.: TRANSFAC: a database on transcription factors and their DNA binding sites. Nucleic Acids Res. 24(1), 238–241 (1996)CrossRefGoogle Scholar
  10. 10.
    Tompa, M., Li, N., Bailey, T.L., et al.: Assessing computational tools for the discovery of transcription factor binding sites. Nat. Biotechnol. 23(1), 137–144 (2005)CrossRefGoogle Scholar
  11. 11.
    University of washington, Computer Science & Engineering. http://bio.cs.washington.edu/assessment/download.html

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Faculty of EngineeringTanta UniversityTantaEgypt

Personalised recommendations