A Review on Planted (l, d) Motif Discovery Algorithms for Medical Diagnose
- PMID: 35161949
- PMCID: PMC8838483
- DOI: 10.3390/s22031204
A Review on Planted (l, d) Motif Discovery Algorithms for Medical Diagnose
Abstract
Personalized diagnosis of chronic disease requires capturing the continual pattern across the biological sequence. This repeating pattern in medical science is called "Motif". Motifs are the short, recurring patterns of biological sequences that are supposed signify some health disorder. They identify the binding sites for transcription factors that modulate and synchronize the gene expression. These motifs are important for the analysis and interpretation of various health issues like human disease, gene function, drug design, patient's conditions, etc. Searching for these patterns is an important step in unraveling the mechanisms of gene expression properly diagnose and treat chronic disease. Thus, motif identification has a vital role in healthcare studies and attracts many researchers. Numerous approaches have been characterized for the motif discovery process. This article attempts to review and analyze fifty-four of the most frequently found motif discovery processes/algorithms from different approaches and summarizes the discussion with their strengths and weaknesses.
Keywords: evolutionary approach; hashing; local search approach; mismatch tree; probabilistic approach; search tree; suffix tree; tries.
Conflict of interest statement
The authors declare no conflict of interest.
Figures
Similar articles
-
A survey of DNA motif finding algorithms.BMC Bioinformatics. 2007 Nov 1;8 Suppl 7(Suppl 7):S21. doi: 10.1186/1471-2105-8-S7-S21. BMC Bioinformatics. 2007. PMID: 18047721 Free PMC article. Review.
-
Improved benchmarks for computational motif discovery.BMC Bioinformatics. 2007 Jun 8;8:193. doi: 10.1186/1471-2105-8-193. BMC Bioinformatics. 2007. PMID: 17559676 Free PMC article.
-
SamSelect: a sample sequence selection algorithm for quorum planted motif search on large DNA datasets.BMC Bioinformatics. 2018 Jun 18;19(1):228. doi: 10.1186/s12859-018-2242-y. BMC Bioinformatics. 2018. PMID: 29914360 Free PMC article.
-
A fast weak motif-finding algorithm based on community detection in graphs.BMC Bioinformatics. 2013 Jul 17;14:227. doi: 10.1186/1471-2105-14-227. BMC Bioinformatics. 2013. PMID: 23865838 Free PMC article.
-
Review of Different Sequence Motif Finding Algorithms.Avicenna J Med Biotechnol. 2019 Apr-Jun;11(2):130-148. Avicenna J Med Biotechnol. 2019. PMID: 31057715 Free PMC article. Review.
Cited by
-
Optimizing resource utilization for large scale problems through architecture aware scheduling.Sci Rep. 2024 Nov 1;14(1):26356. doi: 10.1038/s41598-024-75711-8. Sci Rep. 2024. PMID: 39487166 Free PMC article.
References
-
- Waterman M.S. An Introduction to Computational Biology: Maps, Sequences and Genomes. Chapman & Hall; London, UK: CRC Press; Boca Raton, FL, USA: 1995. Interdisciplinary Statistics.
-
- Chauhan R., Agarwal P. A Review Appling Genetic Algorithm for Motif Discovery. Int. J. Comput. Technol. Appl. 2012;3:1510–1515.
-
- Pradhan M. Master’s Thesis. San Jose State University; San Jose, CA, USA: Dec, 2008. [(accessed on 17 November 2021)]. Motif Discovery in Biological Sequences. Available online: http://scholarworks.sjsu.edu/etd_projects/106.
Publication types
MeSH terms
Substances
Grants and funding
LinkOut - more resources
Full Text Sources