Stepwise Distributed Open Innovation Contests for Software Development: Acceleration of Genome-Wide Association Analysis
Bharadwaj, Ragu B.
Jelinsky, Scott A.
MetadataShow full item record
CitationHill, Andrew, Po-Ru Loh, Ragu B. Bharadwaj, Pascal Pons, Jingbo Shang, Eva Guinan, Karim Lakhani, Iain Kilty, and Scott A. Jelinsky. 2017. “Stepwise Distributed Open Innovation Contests for Software Development: Acceleration of Genome-Wide Association Analysis.” GigaScience 6 (5): 1-10. doi:10.1093/gigascience/gix009. http://dx.doi.org/10.1093/gigascience/gix009.
AbstractAbstract Background: The association of differing genotypes with disease-related phenotypic traits offers great potential to both help identify new therapeutic targets and support stratification of patients who would gain the greatest benefit from specific drug classes. Development of low-cost genotyping and sequencing has made collecting large-scale genotyping data routine in population and therapeutic intervention studies. In addition, a range of new technologies is being used to capture numerous new and complex phenotypic descriptors. As a result, genotype and phenotype datasets have grown exponentially. Genome-wide association studies associate genotypes and phenotypes using methods such as logistic regression. As existing tools for association analysis limit the efficiency by which value can be extracted from increasing volumes of data, there is a pressing need for new software tools that can accelerate association analyses on large genotype-phenotype datasets. Results: Using open innovation (OI) and contest-based crowdsourcing, the logistic regression analysis in a leading, community-standard genetics software package (PLINK 1.07) was substantially accelerated. OI allowed us to do this in <6 months by providing rapid access to highly skilled programmers with specialized, difficult-to-find skill sets. Through a crowd-based contest a combination of computational, numeric, and algorithmic approaches was identified that accelerated the logistic regression in PLINK 1.07 by 18- to 45-fold. Combining contest-derived logistic regression code with coarse-grained parallelization, multithreading, and associated changes to data initialization code further developed through distributed innovation, we achieved an end-to-end speedup of 591-fold for a data set size of 6678 subjects by 645 863 variants, compared to PLINK 1.07's logistic regression. This represents a reduction in run time from 4.8 hours to 29 seconds. Accelerated logistic regression code developed in this project has been incorporated into the PLINK2 project. Conclusions: Using iterative competition-based OI, we have developed a new, faster implementation of logistic regression for genome-wide association studies analysis. We present lessons learned and recommendations on running a successful OI process for bioinformatics.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:33490913
- SPH Scholarly Articles