Efficient network-guided multi-locus association mapping with graph cuts
Chlo\'e-Agathe Azencott, Dominik Grimm, Mahito Sugiyama, Yoshinobu, Kawahara, Karsten M. Borgwardt

TL;DR
This paper introduces SConES, an efficient network-guided multi-locus association mapping method that scales to genome-wide data, improves detection of causal loci, and integrates biological networks for phenotype association.
Contribution
SConES reformulates multi-locus association mapping as a minimum cut problem, enabling exact, rapid solutions that incorporate network connectivity and outperform existing methods.
Findings
SConES scales to hundreds of thousands of loci.
It detects causal SNPs more effectively in simulations.
It identifies loci linked to flowering time in Arabidopsis.
Abstract
As an increasing number of genome-wide association studies reveal the limitations of attempting to explain phenotypic heritability by single genetic loci, there is growing interest for associating complex phenotypes with sets of genetic loci. While several methods for multi-locus mapping have been proposed, it is often unclear how to relate the detected loci to the growing knowledge about gene pathways and networks. The few methods that take biological pathways or networks into account are either restricted to investigating a limited number of predetermined sets of loci, or do not scale to genome-wide settings. We present SConES, a new efficient method to discover sets of genetic loci that are maximally associated with a phenotype, while being connected in an underlying network. Our approach is based on a minimum cut reformulation of the problem of selecting features under sparsity…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
