Demo Data from VLDB 2026 / reviewers in the wild / expert
James T. Elder
dblp:161/2893
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 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
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › functional genomics › functional enrichment analysis
network-based enrichment |
0.2 | 1 | 2015 | Graphical algorithm for integration of genetic and biological data: proof of principle using psoriasis as a model · Bioinform. 2015 |
Bioinformatics and computational biology › functional genomics › functional enrichment analysis
pathway enrichment analysis |
0.2 | 1 | 2015 | Graphical algorithm for integration of genetic and biological data: proof of principle using psoriasis as a model · Bioinform. 2015 |
Bioinformatics and computational biology › statistical genetics
complex trait genetics |
0.1 | 1 | 2015 | Graphical algorithm for integration of genetic and biological data: proof of principle using psoriasis as a model · Bioinform. 2015 |
Bioinformatics and computational biology › genomics
genome-wide association study |
0.1 | 1 | 2015 | Graphical algorithm for integration of genetic and biological data: proof of principle using psoriasis as a model · Bioinform. 2015 |
Methods — techniques the papers use, named apart from their topics
protein-protein interaction network · 0.2permutation sampling · 0.2graphical algorithm · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Graphical algorithm for integration of genetic and biological data: proof of principle using psoriasis as a modelabstractMOTIVATION: Pathway analysis to reveal biological mechanisms for results from genetic association studies have great potential to better understand complex traits with major human disease impact. However, current approaches have not been optimized to maximize statistical power to identify enriched functions/pathways, especially when the genetic data derives from studies using platforms (e.g. Immunochip and Metabochip) customized to have pre-selected markers from previously identified top-rank loci. We present here a novel approach, called Minimum distance-based Enrichment Analysis for Genetic Association (MEAGA), with the potential to address both of these important concerns. RESULTS: MEAGA performs enrichment analysis using graphical algorithms to identify sub-graphs among genes and measure their closeness in interaction database. It also incorporates a statistic summarizing the numbers and total distances of the sub-graphs, depicting the overlap between observed genetic signals and defined function/pathway gene-sets. MEAGA uses sampling technique to approximate empirical and multiple testing-corrected P-values. We show in simulation studies that MEAGA is more powerful compared to count-based strategies in identifying disease-associated functions/pathways, and the increase in power is influenced by the shortest distances among associated genes in the interactome. We applied MEAGA to the results of a meta-analysis of psoriasis using Immunochip datasets, and showed that associated genes are significantly enriched in immune-related functions and closer with each other in the protein-protein interaction network. AVAILABILITY AND IMPLEMENTATION: http://genome.sph.umich.edu/wiki/MEAGA CONTACT: : [email protected] or [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Lam C. Tsoi, James T. Elder, Gonçalo R. Abecasis |
Bioinform. | 2 |