Accurate and efficient estimation of small P-values with the cross-entropy method: applications in genomic data analysis

Author:

Shi Yang1234,Wang Mengqiao2,Shi Weiping5,Lee Ji-Hyun6,Kang Huining3,Jiang Hui478

Affiliation:

1. Division of Biostatistics and Data Science, Department of Population Health Sciences, Medical College of Georgia, Augusta University, Augusta, Georgia, USA

2. Department of Epidemiology and Biostatistics, West China School of Public Health, Sichuan University, Chengdu, Sichuan, China

3. Biostatistics Shared Resource, University of New Mexico Comprehensive Cancer Center and Department of Internal Medicine, University of New Mexico, Albuquerque, New Mexico, USA

4. Department of Biostatistics, University of Michigan, Ann Arbor, Michigan, USA

5. College of Mathematics, Jilin University, Changchun, Jilin, China

6. Division of Quantitative Sciences, University of Florida Health Cancer Center and Department of Biostatistics, University of Florida, Gainesville, Florida, USA

7. Center for Computational Medicine and Bioinformatics

8. University of Michigan Rogel Cancer Center, University of Michigan, Ann Arbor, Michigan, USA

Abstract

Abstract Motivation Small P-values are often required to be accurately estimated in large-scale genomic studies for the adjustment of multiple hypothesis tests and the ranking of genomic features based on their statistical significance. For those complicated test statistics whose cumulative distribution functions are analytically intractable, existing methods usually do not work well with small P-values due to lack of accuracy or computational restrictions. We propose a general approach for accurately and efficiently estimating small P-values for a broad range of complicated test statistics based on the principle of the cross-entropy method and Markov chain Monte Carlo sampling techniques. Results We evaluate the performance of the proposed algorithm through simulations and demonstrate its application to three real-world examples in genomic studies. The results show that our approach can accurately evaluate small to extremely small P-values (e.g. 10-6 to 10-100). The proposed algorithm is helpful for the improvement of some existing test procedures and the development of new test procedures in genomic studies. Availability and implementation R programs for implementing the algorithm and reproducing the results are available at: https://github.com/shilab2017/MCMC-CE-codes. Supplementary information Supplementary data are available at Bioinformatics online.

Funder

Augusta University Medical College of Georgia

Sichuan University

Fundamental Research Funds for the Central Universities of China

National Natural Science Foundation of China

NIH

Publisher

Oxford University Press (OUP)

Subject

Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Molecular Biology,Biochemistry,Statistics and Probability

Reference35 articles.

1. Gene Ontology: tool for the unification of biology;Ashburner;Nat. Genet,2000

2. How accurate are the extremely small P-values used in genomic research: an evaluation of numerical libraries;Bangalore;Comput. Stat. Data Anal,2009

3. On the efficient calculation of a linear combination of chi-square random variables with an application in counting string vacua;Bausch;J. Phys. A Math. Theor,2013

4. Controlling the false discovery rate: a practical and powerful approach to multiple testing;Benjamini;J. R. Stat. Soc. Ser. B (Methodological),1995

5. Proportion statistics to detect differentially expressed genes: a comparison with log-ratio statistics;Bergemann;BMC Bioinformatics,2011

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3