【24h】

AN ARTIFICIAL FISH SWARM BASED SUPERVISED GENE RANK AGGREGATION ALGORITHM FOR INFORMATIVE GENES STUDIES

机译:一种基于人工鱼群的监督基因序列聚合算法,用于信息基因研究

获取原文
获取原文并翻译 | 示例

摘要

As the widespread use of high-throughput genomic and protein analysis, more and more experiments have been done to identify the informative genes for various diseases, thus it provides researchers an opportunity to aggregate across multiple microarray experiments via a rank aggregation approach. However, most of current's microarray rank aggregation methods are either unweighted or prespecified weighted, which has obvious defects. In this paper, We define a new method to weight each ranked list automatically by considering its distances to the other ranked lists and the agreement with some priori knowledge. Then the problem of integrating ranked lists can be formulated as minimizing an objective criterion which is proved to be NP-hard. Accordingly, we use an Artificial Fish Swarm algorithm (AFSA) to solve the well-defined minimization problem of rank aggregation in terms of decision theory. We conduct two sets of experiments to evaluate the performance of our methods. The experimental results show that the proposed approach owns not only the capability of solving optimization problem but also the biological meaning.
机译:随着高通量基因组和蛋白质分析的广泛应用,已经进行了越来越多的实验来鉴定各种疾病的信息基因,因此,它为研究人员提供了通过秩聚方法在多个微阵列实验中进行聚合的机会。然而,当前大多数的微阵列秩聚合方法是未加权的或预先指定的加权的,这具有明显的缺陷。在本文中,我们定义了一种新方法,可以通过考虑每个排名列表与其他排名列表之间的距离以及具有先验知识的协议来自动对每个排名列表进行加权。然后,可以将整合排名列表的问题表述为使证明为NP难的客观标准最小化。因此,根据决策理论,我们使用人工鱼群算法(AFSA)解决了定义明确的秩聚合最小化问题。我们进行了两组实验,以评估我们方法的性能。实验结果表明,该方法不仅具有解决优化问题的能力,而且具有生物学意义。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号