Search bioRxiv⌕ Search

Biology subjects

Zhao, S.-W.

Publications and source records attributed to Zhao, S.-W..

3 recordsLinked to original sources

Relational biological structure improves fine-mapping of causal GWAS variants under weak signal

Linkage disequilibrium (LD) makes causal GWAS variants indistinguishable from correlated neighbours; resolving them is the fine-mapping problem, and the challenge is species-specific: humans face dense ancestry-imbalanced LD, yeast and Arabidopsis exceptionally long LD, and crop germplasm sparse and fragmented annotations that defeat human-biobank curation pipelines. Bayesian fine-mappers integrate annotations as flat per-variant priors, discarding the relational structure linking variants to tissue-specific eQTLs, pathways and protein-protein interactions. Hierarchical belief propagation (HBP) on a variant-gene-pathway factor graph matches Bayesian baselines at 5-40x speed; an annotation-adaptive complement, graph-augmented fine-mapping (GAFM), wins 27-2 against SuSiE at weak signal and recovers LDLR, APOE, LPL, GCKR and ANGPTL3 at single-variant resolution across four Pan-UK Biobank ancestries. On the 3,000 Rice Genomes grain weight + shape panel, mixture-prior posterior reweightings of GAFM/HBP and their ensemble (GAFM-MX, HBP-MX, ENS) reach 47.6% top-1-PIP exact-position recovery of 21 panel-matched stable QTNs -- the highest of any method, exceeding SuSiE (28.6%) and SBayesRC (14.3%) -- at 200-700x SuSiEs per-locus speed. Across 692 leads in four species, a non-uniform per-variant prior, not uniform high coverage, lets the graph break LD ties: adding a regulatory-element flag to an otherwise uniform human cache flips HBP narrower than GAFM from 0% to 88% on 321 Pan-UKB leads. These results recast multi-omics fine-mapping as a non-uniform-prior-curation problem rather than a uniform-coverage problem, and reframe post-GWAS analysis as message passing over biological structure rather than weighted regression on flattened annotations.

genomics↗

GraphMana: graph-native data management for population genomics projects

Population genomics projects rely on fragmented file-based workflows that lose provenance and require full reprocessing when samples are added. Graph-Mana stores variant data in a graph database as packed genotype arrays with pre-computed population statistics, enabling incremental sample addition, provenance tracking, cohort management, and export to 17 formats. Two access paths serve different needs: a FAST PATH reading population-level arrays in O(K) time and a FULL PATH unpacking per-sample genotypes in O(N) time. On human 1000 Genomes data (3,202 samples, 70.7M variants), Graph-Mana completed a 46-operation lifecycle in 98 minutes from a single persistent database.

bioinformatics↗

GraphPop: graph-native computation decouples population genomics complexity from sample count

Matrix-based population genomics tools scale as O(V x N ), re-reading the full genotype matrix for every analysis. Here we present GraphPop, a graph database engine that reduces summary statistic complexity to O(V x K) where K is population count--independent of sample count--by computing on pre-aggregated allele-count arrays stored as graph node properties. The same architecture enables annotation-conditioned queries via edge traversal, persistent analytical records, and multi-statistic composition. Applied to rice 3K (29.6M SNPs, 3,024 accessions) and human 1000 Genomes (3,202 samples, 22 autosomes), GraphPop reveals that all 12 rice subpopulations show{pi} N /{pi}S > 1.0, uncovers opposite consequence-level Fst regimes between species, and identifies KCNE1 as a candidate pre-Out-of-Africa sweep via convergence of five stored statistics. GraphPop achieves 146-327x query-time speedup for pre-aggregated statistics and 63-179x for bit-packed haplotype computation (iHS, XP-EHH, nSL), at constant[~] 160 MB procedure working memory. This complexity reduction makes systematic, annotation-integrated population genomics practical at scale.

bioinformatics↗