Discovery Biological Motifs Using Heuristics Approaches

J. C. Garbelini, A. Kashiwabara, D. Sanches
{"title":"Discovery Biological Motifs Using Heuristics Approaches","authors":"J. C. Garbelini, A. Kashiwabara, D. Sanches","doi":"10.1109/BRACIS.2016.041","DOIUrl":null,"url":null,"abstract":"The identification of transcription factors binding sites (TFBS) – also called motifs – in DNA sequences is the first step to understanding how works gene regulation. Recognizing these patterns in the promoter regions of co-expressed genes is a determining key for this. Although there are several algorithms for this purpose, the problem is still far from being solved because of the great diversity of gene expression and the binding sites low specificity. State of the art algorithms have limitations, such as the high number of false positives and low accuracy for Identifying weak motifs. In this article we proposed a new approach based on memetic algorithms (DMMA) for discovery mofifs. The proposed approach was developed using evolutionary computation along with the local search algorithms simulated annealing and variable neighborhood search. To attest the algorithm ability, tests were conducted in four datasets - two real and two synthetic - and the results were compared with other approaches in the literature.","PeriodicalId":183149,"journal":{"name":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 5th Brazilian Conference on Intelligent Systems (BRACIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BRACIS.2016.041","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The identification of transcription factors binding sites (TFBS) – also called motifs – in DNA sequences is the first step to understanding how works gene regulation. Recognizing these patterns in the promoter regions of co-expressed genes is a determining key for this. Although there are several algorithms for this purpose, the problem is still far from being solved because of the great diversity of gene expression and the binding sites low specificity. State of the art algorithms have limitations, such as the high number of false positives and low accuracy for Identifying weak motifs. In this article we proposed a new approach based on memetic algorithms (DMMA) for discovery mofifs. The proposed approach was developed using evolutionary computation along with the local search algorithms simulated annealing and variable neighborhood search. To attest the algorithm ability, tests were conducted in four datasets - two real and two synthetic - and the results were compared with other approaches in the literature.
使用启发式方法发现生物基序
鉴定DNA序列中的转录因子结合位点(TFBS)——也称为基序——是了解基因调控如何起作用的第一步。在共表达基因的启动子区域识别这些模式是决定这一点的关键。虽然有几种算法,但由于基因表达的多样性和结合位点的低特异性,这一问题仍远未解决。现有的算法存在一定的局限性,如误报率高、识别弱基序的准确率低。本文提出了一种基于模因算法(memetic algorithms, DMMA)的发现动机的新方法。该方法采用进化计算方法,结合局部搜索算法、模拟退火算法和变邻域搜索算法。为了验证算法的能力,在四个数据集(两个真实数据集和两个合成数据集)中进行了测试,并将结果与文献中的其他方法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信