Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Wenhua Wei

dblp:02/9660 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2016
0000-0001-5774-5941ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 3Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 85% Computational science and engineering · 15%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 50% GPUs and heterogeneous computing · 50%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › genomics
genome-wide association study
0.322012
High-throughput analysis of epistasis in genome-wide association studies with BiForce · Bioinform. 2012
EpiGPU: exhaustive pairwise epistasis scans parallelized on consumer level graphics cards · Bioinform. 2011
Bioinformatics and computational biology › statistical genetics › gene-gene interaction
epistasis analysis
0.112012
High-throughput analysis of epistasis in genome-wide association studies with BiForce · Bioinform. 2012
Bioinformatics and computational biology › statistical genetics › gene-gene interaction
epistasis
0.112011
EpiGPU: exhaustive pairwise epistasis scans parallelized on consumer level graphics cards · Bioinform. 2011
Bioinformatics and computational biology
genomics
0.112011
EpiGPU: exhaustive pairwise epistasis scans parallelized on consumer level graphics cards · Bioinform. 2011
Computational science and engineering › parallel computing
GPU acceleration
0.112011
EpiGPU: exhaustive pairwise epistasis scans parallelized on consumer level graphics cards · Bioinform. 2011
Bioinformatics and computational biology › statistical genetics
complex trait genetics
0.012012
High-throughput analysis of epistasis in genome-wide association studies with BiForce · Bioinform. 2012
GPUs and heterogeneous computing
GPU computing
0.012011
EpiGPU: exhaustive pairwise epistasis scans parallelized on consumer level graphics cards · Bioinform. 2011
Parallel and multicore computing
parallel computing
0.012011
EpiGPU: exhaustive pairwise epistasis scans parallelized on consumer level graphics cards · Bioinform. 2011

Methods — techniques the papers use, named apart from their topics

OpenCL · 0.2multithreaded parallelization · 0.1boolean bitwise operations · 0.1bonferroni correction · 0.1
YearPublicationVenuePosition
2016 Image inpainting algorithm based on TV model and evolutionary algorithm
Kangshun Li, Yunshan Wei, Wenhua Wei
Soft Comput.4
2013 Corrigendum of 'High throughput analysis of epistasis in genome-wide association studies with BiForce'
abstract
Abstract Contact: [email protected]
Attila Gyenesei, C. A. M. Semple, Chris S. Haley, Wenhua Wei
Bioinform.4
2012 High-throughput analysis of epistasis in genome-wide association studies with BiForce
abstract
MOTIVATION: Gene-gene interactions (epistasis) are thought to be important in shaping complex traits, but they have been under-explored in genome-wide association studies (GWAS) due to the computational challenge of enumerating billions of single nucleotide polymorphism (SNP) combinations. Fast screening tools are needed to make epistasis analysis routinely available in GWAS. RESULTS: We present BiForce to support high-throughput analysis of epistasis in GWAS for either quantitative or binary disease (case-control) traits. BiForce achieves great computational efficiency by using memory efficient data structures, Boolean bitwise operations and multithreaded parallelization. It performs a full pair-wise genome scan to detect interactions involving SNPs with or without significant marginal effects using appropriate Bonferroni-corrected significance thresholds. We show that BiForce is more powerful and significantly faster than published tools for both binary and quantitative traits in a series of performance tests on simulated and real datasets. We demonstrate BiForce in analysing eight metabolic traits in a GWAS cohort (323 697 SNPs, >4500 individuals) and two disease traits in another (>340 000 SNPs, >1750 cases and 1500 controls) on a 32-node computing cluster. BiForce completed analyses of the eight metabolic traits within 1 day, identified nine epistatic pairs of SNPs in five metabolic traits and 18 SNP pairs in two disease traits. BiForce can make the analysis of epistasis a routine exercise in GWAS and thus improve our understanding of the role of epistasis in the genetic regulation of complex traits. AVAILABILITY AND IMPLEMENTATION: The software is free and can be downloaded from http://bioinfo.utu.fi/BiForce/. CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Attila Gyenesei, Jonathan Moody, C. A. M. Semple, Chris S. Haley, Wenhua Wei
Bioinform.5
2011 EpiGPU: exhaustive pairwise epistasis scans parallelized on consumer level graphics cards
abstract
MOTIVATION: Hundreds of genome-wide association studies have been performed over the last decade, but as single nucleotide polymorphism (SNP) chip density has increased so has the computational burden to search for epistasis [for n SNPs the computational time resource is O(n(n-1)/2)]. While the theoretical contribution of epistasis toward phenotypes of medical and economic importance is widely discussed, empirical evidence is conspicuously absent because its analysis is often computationally prohibitive. To facilitate resolution in this field, tools must be made available that can render the search for epistasis universally viable in terms of hardware availability, cost and computational time. RESULTS: By partitioning the 2D search grid across the multicore architecture of a modern consumer graphics processing unit (GPU), we report a 92× increase in the speed of an exhaustive pairwise epistasis scan for a quantitative phenotype, and we expect the speed to increase as graphics cards continue to improve. To achieve a comparable computational improvement without a graphics card would require a large compute-cluster, an option that is often financially non-viable. The implementation presented uses OpenCL--an open-source library designed to run on any commercially available GPU and on any operating system. AVAILABILITY: The software is free, open-source, platformindependent and GPU-vendor independent. It can be downloaded from http://sourceforge.net/projects/epigpu/.
Gibran Hemani, Athanasios Theocharidis, Wenhua Wei, Chris S. Haley
Bioinform.3