.png){kind=icon}
返回
Multi-objective dynamic population shuffled frog-leaping biclustering of microarray data
.png){kind=icon}
OA
AI
DOI：10.1186/1471-2164-13-S3-S6.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Background: Multi-objective optimization (MOO) involves optimization problems with multiple objectives. Generally, theose objectives is used to estimate very different aspects of the solutions, and these aspects are often in conflict with each other. MOO first gets a Pareto set, and then looks for both commonality and systematic variations across the set. For the large-scale data sets, heuristic search algorithms such as EA combined with MOO techniques are ideal. Newly DNA microarray technology may study the transcriptional response of a complete genome to different experimental conditions and yield a lot of large-scale datasets. Biclustering technique can simultaneously cluster rows and columns of a dataset, and hlep to extract more accurate information from those datasets. Biclustering need optimize several conflicting objectives, and can be solved with MOO methods. As a heuristics-based optimization approach, the particle swarm optimization (PSO) simulate the movements of a bird flock finding food. The shuffled frog-leaping algorithm (SFL) is a population-based cooperative search metaphor combining the benefits of the local search of PSO and the global shuffled of information of the complex evolution technique. SFL is used to solve the optimization problems of the large-scale datasets. Results: This paper integrates dynamic population strategy and shuffled frog-leaping algorithm into biclustering of microarray data, and proposes a novel multi-objective dynamic population shuffled frog-leaping biclustering (MODPSFLB) algorithm to mine maximum bicluesters from microarray data. Experimental results show that the proposed MODPSFLB algorithm can effectively find significant biological structures in terms of related biological processes, components and molecular functions. Conclusions: The proposed MODPSFLB algorithm has good diversity and fast convergence of Pareto solutions and will become a powerful systematic functional analysis in genome research.
Keyword:
GENE-EXPRESSION
ALGORITHMS
OPTIMIZATION
SIZE
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.7
论文数:
1.9W
被引数:
5.2W
机构
引用论文
.png){kind=icon}
Prediction of Pregabalin-Mediated Pain Response by Severity of Sleep Disturbance in Patients with Painful Diabetic Neuropathy and Post-Herpetic Neuralgia疼痛性糖尿病神经病变和带状疱疹后神经痛患者睡眠障碍严重程度预测普瑞巴林介导的疼痛反应
PREAI
分享收藏分享收藏Constraint-handling in genetic algorithms through the use of dominance-based tournament selection
PREAI
分享收藏Optimization of water distribution network design using the Shuffled Frog Leaping Algorithm基于混合蛙跳算法的供水管网优化设计
PREAI
分享收藏分享收藏
查看更多内容