4.3 Article

A Generic Coalescent-based Framework for the Selection of a Reference Panel for Imputation

期刊

GENETIC EPIDEMIOLOGY
卷 34, 期 8, 页码 773-782

出版社

WILEY
DOI: 10.1002/gepi.20505

关键词

genotype imputation; coalescent; GWAS; linkage disequilibrium; weighted panel

资金

  1. National Science Foundation [IIS-071325412]
  2. Israel Science Foundation [04514831]

向作者/读者索取更多资源

An important component in the analysis of genome-wide association studies involves the imputation of genotypes that have not been measured directly in the studied samples. The imputation procedure uses the linkage disequilibrium (LD) structure in the population to infer the genotype of an unobserved single nucleotide polymorphism. The LD structure is normally learned from a dense genotype map of a reference population that matches the studied population. In many instances there is no reference population that exactly matches the studied population, and a natural question arises as to how to choose the reference population for the imputation. Here we present a Coalescent-based method that addresses this issue. In contrast to the current paradigm of imputation methods, our method assigns a different reference dataset for each sample in the studied population, and for each region in the genome. This allows the flexibility to account for the diversity within populations, as well as across populations. Furthermore, because our approach treats each region in the genome separately, our method is suitable for the imputation of recently admixed populations. We evaluated our method across a large set of populations and found that our choice of reference data set considerably improves the accuracy of imputation, especially for regions with low LD and for populations without a reference population available as well as for admixed populations such as the Hispanic population. Our method is generic and can potentially be incorporated in any of the available imputation methods as an add-on. Genet. Epidemiol. 34:773-782, 2010. (C) 2010 Wiley-Liss, Inc.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.3
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Multidisciplinary Sciences

Programming active cohesive granular matter with mechanically induced phase changes

Shengkai Li, Bahnisikha Dutta, Sarah Cannon, Joshua J. Daymude, Ram Avinery, Enes Aydin, Andrea W. Richa, Daniel Goldman, Dana Randall

Summary: This study introduces a method for controlling robotic swarms at macro and micro scales through theoretical abstraction and experimental systems, exploring collective behaviors guided by physical interactions. The research shows that increasing interparticle attraction can lead to a transition from dispersed to compact phase, enabling the collective to perform emergent tasks.

SCIENCE ADVANCES (2021)

Article Computer Science, Theory & Methods

AN EXPONENTIAL SEPARATION BETWEEN MA AND AM PROOFS OF PROXIMITY

Tom Gur, Yang P. Liu, Ron D. Rothblum

Summary: Interactive proofs of proximity allow a sublinear-time verifier to check a given input close to the language with a small amount of communication with a powerful prover. This work considers two minimally interactive variants of such proofs systems, MA-proofs and AMPs, showing an exponential separation in their power. The notion of oblivious proofs of proximity is also discussed, revealing a quadratic difference between AMPs and MAPs.

COMPUTATIONAL COMPLEXITY (2021)

Article Computer Science, Theory & Methods

Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP

Oded Goldreich, Tom Gur

Summary: Universal Locally Verifiable Codes (Universal-LVCs) are codes that allow local testing of properties of the encoded inputs using short proofs. These codes are useful for encoding inputs under which a large family of properties can be locally testable using a short proof.

THEORETICAL COMPUTER SCIENCE (2021)

Editorial Material Genetics & Heredity

On powerful GWAS in admixed populations

Kangcheng Hou, Arjun Bhattacharya, Rachel Mester, Kathryn S. Burch, Bogdan Pasaniuc

NATURE GENETICS (2021)

Article Genetics & Heredity

Large uncertainty in individual polygenic risk score estimation impacts PRS-based risk stratification

Yi Ding, Kangcheng Hou, Kathryn S. Burch, Sandra Lapinska, Florian Prive, Bjarni Vilhjalmsson, Sriram Sankararaman, Bogdan Pasaniuc

Summary: The study shows that Bayesian PRS methods can estimate the individual PRS variance and generate well-calibrated credible intervals through posterior sampling. Analysis of real traits in the UK Biobank demonstrates that large uncertainty in polygenic risk score (PRS) estimates at the individual level impacts the interpretation of subsequent analyses such as PRS-based stratification.

NATURE GENETICS (2022)

Article Biochemical Research Methods

Estimation of regional polygenicity from GWAS provides insights into the genetic architecture of complex traits

Ruth Johnson, Kathryn S. Burch, Kangcheng Hou, Mario Paciuc, Bogdan Pasaniuc, Sriram Sankararaman

Summary: The study introduces a statistical framework to estimate regional polygenicity of complex traits, finding that anthropometric and blood pressure traits are highly polygenic with wide variation in regional polygenicity.

PLOS COMPUTATIONAL BIOLOGY (2021)

Article Genetics & Heredity

Partitioning gene-level contributions to complex-trait heritability by allele frequency identifies disease-relevant genes

Kathryn S. Burch, Kangcheng Hou, Yi Ding, Yifei Wang, Steven Gazal, Huwenbo Shi, Bogdan Pasaniuc

Summary: Recent research shows that SNP heritability may not be the most relevant quantity for localizing high-effect/critical disease genes. By estimating gene-level heritability, we found that approximately 2.5% of genes have a rare-variant component, and only about 0.8% of genes have heritability exclusively from rare variants. These additional genes include 114 gene-trait pairs that were not detected by existing methods. The rare-variant component of gene-level heritability exhibits different trends compared to common-variant gene-level heritability.

AMERICAN JOURNAL OF HUMAN GENETICS (2022)

Article Computer Science, Hardware & Architecture

Spatial Isolation Implies Zero Knowledge Even in a Quantum World

Alessandro Chiesa, Michael A. Forbes, Tom Gur, Nicholas Spooner

Summary: This paper studies whether spatial isolation still suffices to unconditionally achieve zero knowledge even in the presence of quantum entanglement. The research shows that for every language in NEXP, there exists a 2-prover zero knowledge interactive proof that is sound against entangled provers.

JOURNAL OF THE ACM (2022)

Article Computer Science, Theory & Methods

RELAXED LOCALLY CORRECTABLE CODES WITH NEARLY-LINEAR BLOCK LENGTH AND CONSTANT QUERY COMPLEXITY

Alessandro Chiesa, Tom Gur, Igor Shinkar

Summary: Locally correctable codes (LCCs) are error correcting codes that can correct any symbol of a corrupted codeword locally. Constructing LCCs with minimal block length and O(1)-query algorithms has been a central problem in algorithmic coding theory, and recent progress has been made in constructing relaxed LCCs.

SIAM JOURNAL ON COMPUTING (2022)

Article Multidisciplinary Sciences

Polygenic scoring accuracy varies across the genetic ancestry continuum

Yi Ding, Kangcheng Hou, Ziqi Xu, Aditya Pimplaskar, Ella Petter, Kristin Boulier, Florian Prive, Bjarni J. Vilhjalmsson, Loes M. Olde Loohuis, Bogdan Pasaniuc

Summary: Polygenic scores (PGSs) have limited portability across different groupings of individuals, hindering their equitable use. We demonstrated that PGS accuracy decreases individual-to-individual along the continuum of genetic ancestries, even within traditionally labelled 'homogeneous' genetic ancestries. Our results highlight the need to move away from discrete genetic ancestry clusters towards the continuum of genetic ancestries when considering PGSs.

NATURE (2023)

Proceedings Paper Computer Science, Theory & Methods

Hypercontractivity on High Dimensional Expanders

Tom Gur, Noam Lifshitz, Siqi Liu

Summary: We prove hypercontractive inequalities on high dimensional expanders and use these inequalities to obtain certain properties.

PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22) (2022)

Proceedings Paper Computer Science, Theory & Methods

Worst-Case to Average-Case Reductions via Additive Combinatorics

Vahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar

Summary: This research presents a new framework for designing worst-case to average-case reductions. By applying this framework, algorithms that are only correct on a small fraction of inputs can be transformed into algorithms that are correct on all inputs. This framework has been successfully applied to various computational models and solved fundamental problems.

PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22) (2022)

Proceedings Paper Computer Science, Theory & Methods

Quantum learning algorithms imply circuit lower bounds

Srinivasan Arunachalam, Alex B. Grilo, Tom Gur, Igor C. Oliveira, Aarthi Sundaram

Summary: This paper establishes the connection between the design of quantum algorithms and circuit lower bounds. It shows that even a marginal quantum speedup over generic learning algorithms would have significant consequences in complexity lower bounds.

2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021) (2022)

Article Computer Science, Theory & Methods

ON THE POWER OF RELAXED LOCAL DECODING ALGORITHMS

Tom Gur, Oded Lachish

Summary: Locally decodable codes have various applications, with recent constructions achieving a blocklength n = O(k(1+gamma)) for O(1)-query relaxed LDCs. However, a lower bound shows that achieving blocklength n = k(1+o(1)) for O(1)-query relaxed LDCs is not possible, resolving an open problem raised in 2004.

SIAM JOURNAL ON COMPUTING (2021)

Proceedings Paper Computer Science, Theory & Methods

Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity

Alessandro Chiesa, Tom Gur, Igor Shinkar

PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20) (2020)

暂无数据