EUVIMEDEUVIMED entdecken
Crossref

An efficient method for significant motifs discovery from multiple DNA sequences

Abdulrakeeb M Al-Ssulami, Aqil M Azmi, Hassan Mathkour

Journal of Bioinformatics and Computational Biology · 2017-08 · 15 (04) · 1750014

DOI: 10.1142/s0219720017500147 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Bioinformatics and Computational Biology, online erschienen am 22.08.2017. Verfasst von Abdulrakeeb M Al-Ssulami und 2 weiteren Autor:innen. Beteiligte Einrichtung: 1 Department of Computer Science, College of Computer & Information Sciences, King Saud University, Riyadh 11543, Saudi Arabia. Hauptthemen laut MEDLINE: Algorithms, Nucleotide Motifs. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 28 Literaturangaben.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Identification of transcription factor binding sites or biological motifs is an important step in deciphering the mechanisms of gene regulation. It is a classic problem that has eluded a satisfactory and efficient solution. In this paper, we devise a three-phase algorithm to mine for biologically significant motifs. In the first phase, we generate all the possible string motifs, this phase is followed by a filtering process where we discard all motifs that do not meet the constraints. And in the final phase, motifs are scored and ranked using a combination of stochastic techniques and [Formula: see text]-value. We show that our method outperforms some very well-known motif discovery tools, e.g. MEME and Weeder on well-established benchmark data suites. We also apply the algorithm on the non-coding regions of M. tuberculosis and report significant motifs of size 10 with excellent [Formula: see text]-values in a fraction of the time MEME and MoSDi did. In fact, among the best 10 motifs ([Formula: see text]-value wise) in the non-coding regions of M. tuberculosis reported by the tools MEME, MoSDi and ours, five were discovered by our approach which included the third and the fourth best ones. All this in 1/17 and 1/6 the time which MEME and MoSDi (respectively) took.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsNucleotide MotifsBacterial ProteinsBinding SitesComputational BiologyMycobacterium tuberculosisSequence Analysis, DNATranscription Factors

Stichwörter der Autor:innen

DNA motifsM. tuberculosisalgorithmssequence analysis

Substanzen

Bacterial ProteinsTranscription Factors

Autor:innen und Institutionen

  • 1 Department of Computer Science, College of Computer & Information Sciences, King Saud University, Riyadh 11543, Saudi Arabia.

Zitieren

APA

Al-Ssulami, A. M., Azmi, A. M., & Mathkour, H. (2017). An efficient method for significant motifs discovery from multiple DNA sequences. Journal of Bioinformatics and Computational Biology, 15(04), 1750014. https://doi.org/10.1142/s0219720017500147

Vancouver

Al-Ssulami AM, Azmi AM, Mathkour H. An efficient method for significant motifs discovery from multiple DNA sequences. Journal of Bioinformatics and Computational Biology. 2017;15(04):1750014. doi:10.1142/s0219720017500147

BibTeX
@article{AlSsulami2017,
  author = {Al-Ssulami, Abdulrakeeb M and Azmi, Aqil M and Mathkour, Hassan},
  title = {An efficient method for significant motifs discovery from multiple DNA sequences},
  journal = {Journal of Bioinformatics and Computational Biology},
  year = {2017},
  volume = {15},
  number = {04},
  pages = {1750014},
  doi = {10.1142/s0219720017500147}
}
Kostenlos starten →