Poster Type: Research Posters
Author: Yifan Li (Cornell University), Qingyao Sun (Cornell University), Drew DeHaas (Cornell University), Xinzhu Wei (Cornell University), Giulia Guidi (Cornell University)
Abstract: Biobank initiatives include half a million phased genomes, outpacing the tools available to analyze them. Conventional genotype formats treat variants independently and fail to exploit the shared ancestry structure underlying population genetic variation. Prior work introduced the genotype representation graph, a compact graph encoding that captures shared ancestry directly but relies on traversal algorithms that map poorly onto modern accelerators. Here, we show that this computation can be expressed exactly as sparse linear algebra: under a topological ordering, the graph’s adjacency matrix becomes strictly block triangular, so the core genotype matrix–vector product reduces to a block sparse triangular solve. Further, we decompose this solve into a pipelined sequence of blocked sparse matrix-vector multiplications, exposing fine-grained parallelism and enabling mature, hardware-optimized primitives in place of hand-tuned kernels. The result is substantial, portable speedups across accelerator hardware, from cloud deployments to supercomputers.
Best Poster Finalist (BP): no
Poster: PDF
Poster Summary: PDF