Authors :
Prince Joseph
Volume/Issue :
Volume 8 - 2023, Issue 10 - October
Google Scholar :
https://tinyurl.com/2tz8zm62
Scribd :
https://tinyurl.com/37s2xmb3
DOI :
https://doi.org/10.5281/zenodo.8430881
Abstract :
Finding patterns in DNA sequences, a
challenging task in molecular biology and computer
science, plays a crucial role in understanding gene
expression and transcription regulation. This article
explores various computational methods for identifying
transcription factor binding sites TFBS and regulatory
motifs in DNA sequences. We discuss the significance of
these motifs in gene expression and disease susceptibility
research. The article categorizes motif discovery
algorithms into enumerative, probabilistic,
combinatorial, and nature-inspired approaches,
highlighting their strengths and limitations. It
emphasizes the need for a comprehensive motif discovery
tool that can handle diverse motif types, perform global
searches efficiently, and reduce user-defined parameters.
Keywords :
Motif Discovery, Transcription Factor Binding Sites TFBS, Gene Expression, DNA Sequences, Computational Methods.
Finding patterns in DNA sequences, a
challenging task in molecular biology and computer
science, plays a crucial role in understanding gene
expression and transcription regulation. This article
explores various computational methods for identifying
transcription factor binding sites TFBS and regulatory
motifs in DNA sequences. We discuss the significance of
these motifs in gene expression and disease susceptibility
research. The article categorizes motif discovery
algorithms into enumerative, probabilistic,
combinatorial, and nature-inspired approaches,
highlighting their strengths and limitations. It
emphasizes the need for a comprehensive motif discovery
tool that can handle diverse motif types, perform global
searches efficiently, and reduce user-defined parameters.
Keywords :
Motif Discovery, Transcription Factor Binding Sites TFBS, Gene Expression, DNA Sequences, Computational Methods.
