M. V. Grishchenko, A. Yakimenko, M. Khairetdinov, A. V. Lazareva
{"title":"基于随机化的富集分析并行算法的改进","authors":"M. V. Grishchenko, A. Yakimenko, M. Khairetdinov, A. V. Lazareva","doi":"10.1109/SIBIRCON.2017.8109886","DOIUrl":null,"url":null,"abstract":"This work is motivated by algorithm that is used to analyze the multidimensional genetic data. This algorithm, called permutation test, is widely used as part of gene set enrichment analysis method. In this paper, the permutation test algorithm is considered. The dependence of the resampling test algorithm performance on the input data is studied. Several ways to improve the permutation test algorithm are proposed. The most effective way consisting in the reduction of number of iterations of the algorithm is implemented.","PeriodicalId":135870,"journal":{"name":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The improvement of the parallel algorithm for randomization-based enrichment analysis\",\"authors\":\"M. V. Grishchenko, A. Yakimenko, M. Khairetdinov, A. V. Lazareva\",\"doi\":\"10.1109/SIBIRCON.2017.8109886\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work is motivated by algorithm that is used to analyze the multidimensional genetic data. This algorithm, called permutation test, is widely used as part of gene set enrichment analysis method. In this paper, the permutation test algorithm is considered. The dependence of the resampling test algorithm performance on the input data is studied. Several ways to improve the permutation test algorithm are proposed. The most effective way consisting in the reduction of number of iterations of the algorithm is implemented.\",\"PeriodicalId\":135870,\"journal\":{\"name\":\"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIBIRCON.2017.8109886\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBIRCON.2017.8109886","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The improvement of the parallel algorithm for randomization-based enrichment analysis
This work is motivated by algorithm that is used to analyze the multidimensional genetic data. This algorithm, called permutation test, is widely used as part of gene set enrichment analysis method. In this paper, the permutation test algorithm is considered. The dependence of the resampling test algorithm performance on the input data is studied. Several ways to improve the permutation test algorithm are proposed. The most effective way consisting in the reduction of number of iterations of the algorithm is implemented.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
