A Bayesian Scoring Scheme based Particle Swarm Optimization algorithm to identify transcription factor binding sites
详细信息 查看全文
- 作者：Mustafa Karabulut ; Turgay Ibrikci
- 关键词：Particle Swarm Optimization ; DNA motif ; Transcription factor binding site ; Neighborhood topology ; Bayesian
- 刊名：Applied Soft Computing Journal
- 出版年：2012
- 出版时间：September, 2012
- 年：2012
- 卷：12
- 期：9
- 页码：2846-2855
- 全文大小：1106 K
文摘
Identification of transcription factor binding sites is a vital task in contemporary biology, since it helps researchers to comprehend the regulatory mechanism of gene expression. Computational tools to perform this task have gained great attention since they are good alternatives to expensive and laborious biological experiments. In this paper, we propose a Particle Swarm Optimization based motif-finding method that utilizes a proven Bayesian Scoring Scheme as the fitness function. Since PSO is designed to work in multidimensional continuous domains, this paper presents required developments to adapt PSO for the motif finding application. Furthermore, this paper presents a benchmark of PSO variants with four separate population topologies, GBest, Bidirectional Ring, Random and Von Neumann. Simulations performed over synthetic and real data sets have shown that the proposed method is efficient and also superior to some well-known existing tools. Additionally, the Bidirectional Ring topology appears to be remarkable for the motif-finding application.