Comparative analysis of computational based motif refinement methods
Lecturer in Computer Engineering, Govt Polytechnic College Pala, India.
Review
Open Access Research Journal of Science and Technology, 2023, 09(01), 052–056.
Article DOI: 10.53022/oarjst.2023.9.1.0060
Publication history:
Received on 28 August 2023; revised on 04 October 2023; accepted on 06 October 2023
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
Full text article in PDF:
Copyright information:
Copyright © 2023 Author(s) retain the copyright of this article. This article is published under the terms of the Creative Commons Attribution Liscense 4.0