首页> 美国卫生研究院文献>BMC Bioinformatics >A fast algorithm for determining bounds and accurate approximate p-values of the rank product statistic for replicate experiments
【2h】

A fast algorithm for determining bounds and accurate approximate p-values of the rank product statistic for replicate experiments

机译:一种用于确定重复实验的秩积统计量的界限和准确的近似p值的快速算法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

BackgroundThe rank product method is a powerful statistical technique for identifying differentially expressed molecules in replicated experiments. A critical issue in molecule selection is accurate calculation of the p-value of the rank product statistic to adequately address multiple testing. Both exact calculation and permutation and gamma approximations have been proposed to determine molecule-level significance. These current approaches have serious drawbacks as they are either computationally burdensome or provide inaccurate estimates in the tail of the p-value distribution.
机译:背景秩乘法是一种用于在重复实验中鉴定差异表达分子的强大统计技术。分子选择中的一个关键问题是准确计算等级乘积统计量的p值,以充分应对多次测试。已经提出精确计算和置换以及伽马近似来确定分子水平的重要性。这些当前方法具有严重的缺点,因为它们要么计算繁重,要么在p值分布的尾部提供不准确的估计。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号