Zhihui Zhou, Guixia Liu, Lingtao Su, Lun Yan, Liang Han
{"title":"CChi: An efficient cloud epistasis test model in human genome wide association studies","authors":"Zhihui Zhou, Guixia Liu, Lingtao Su, Lun Yan, Liang Han","doi":"10.1109/BMEI.2013.6747047","DOIUrl":null,"url":null,"abstract":"Due to the vast amounts of SNPs and huge search space, how to decrease the total computation costs is a challenge in genome wide association studies (GWAS). Triggered by this problem, we develop an effective and efficient algorithm for epistasis detection in GWAS. We propose a cloud-based algorithm using chi-square test, denoted as CChi. CChi adopts a pruning strategy by utilizing an upper bound to prune amounts of unnecessary SNP pairs, and is implemented under Google's MapReduce framework. A best-fit model is proposed by us to distribute SNP pairs to each reducer. Extensive experimental results demonstrate that CChi is practically and computationally efficient.","PeriodicalId":163211,"journal":{"name":"2013 6th International Conference on Biomedical Engineering and Informatics","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 6th International Conference on Biomedical Engineering and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BMEI.2013.6747047","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
Due to the vast amounts of SNPs and huge search space, how to decrease the total computation costs is a challenge in genome wide association studies (GWAS). Triggered by this problem, we develop an effective and efficient algorithm for epistasis detection in GWAS. We propose a cloud-based algorithm using chi-square test, denoted as CChi. CChi adopts a pruning strategy by utilizing an upper bound to prune amounts of unnecessary SNP pairs, and is implemented under Google's MapReduce framework. A best-fit model is proposed by us to distribute SNP pairs to each reducer. Extensive experimental results demonstrate that CChi is practically and computationally efficient.