|
|
Avicenna Journal of Medical Biotechnology، جلد ۱۱، شماره ۲، صفحات ۱۳۰-۱۴۸
|
|
|
| عنوان فارسی |
|
|
| چکیده فارسی مقاله |
|
|
| کلیدواژه‌های فارسی مقاله |
|
|
| عنوان انگلیسی |
Review of Different Sequence Motif Finding Algorithms |
|
| چکیده انگلیسی مقاله |
The DNA motif discovery is a primary step in many systems for studying gene function. Motif discovery plays a vital role in identification of Transcription Factor Binding Sites (TFBSs) that help in learning the mechanisms for regulation of gene expression. Over the past decades, different algorithms were used to design fast and accurate motif discovery tools. These algorithms are generally classified into consensus or probabilistic approaches that many of them are time-consuming and easily trapped in a local optimum. Nature-inspired algorithms and many of combinatorial algorithms are recently proposed to overcome these problems. This paper presents a general classification of motif discovery algorithms with new sub-categories that facilitate building a successful motif discovery algorithm. It also presents a summary of comparison between them. |
|
| کلیدواژه‌های انگلیسی مقاله |
|
|
| نویسندگان مقاله |
|
|
| نشانی اینترنتی |
http://www.ajmb.org/En/Article.aspx?id=10368 |
| فایل مقاله |
اشکال در دسترسی به فایل - ./files/site1/rds_journals/133/article-133-1975013.pdf |
| کد مقاله (doi) |
|
| زبان مقاله منتشر شده |
en |
| موضوعات مقاله منتشر شده |
|
| نوع مقاله منتشر شده |
|
|
|
|
برگشت به:
صفحه اول پایگاه |
نسخه مرتبط |
نشریه مرتبط |
فهرست نشریات
|