首页> 美国卫生研究院文献>BMC Bioinformatics >Performance of a blockwise approach in variable selection using linkage disequilibrium information
【2h】

Performance of a blockwise approach in variable selection using linkage disequilibrium information

机译:使用连锁不平衡信息的变量选择中分块方法的性能

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。
获取外文期刊封面目录资料

摘要

BackgroundGenome-wide association studies (GWAS) aim at finding genetic markers that are significantly associated with a phenotype of interest. Single nucleotide polymorphism (SNP) data from the entire genome are collected for many thousands of SNP markers, leading to high-dimensional regression problems where the number of predictors greatly exceeds the number of observations. Moreover, these predictors are statistically dependent, in particular due to linkage disequilibrium (LD).We propose a three-step approach that explicitly takes advantage of the grouping structure induced by LD in order to identify common variants which may have been missed by single marker analyses (SMA). In the first step, we perform a hierarchical clustering of SNPs with an adjacency constraint using LD as a similarity measure. In the second step, we apply a model selection approach to the obtained hierarchy in order to define LD blocks. Finally, we perform Group Lasso regression on the inferred LD blocks. We investigate the efficiency of this approach compared to state-of-the art regression methods: haplotype association tests, SMA, and Lasso and Elastic-Net regressions.
机译:背景全基因组关联研究(GWAS)旨在寻找与目标表型显着相关的遗传标记。从整个基因组中收集了成千上万个SNP标记的单核苷酸多态性(SNP)数据,从而导致了高维回归问题,其中预测变量的数量大大超过观测数量。此外,这些预测变量在统计上是相关的,尤其是由于连锁不平衡(LD)。我们提出了一种三步方法,该方法明确利用LD诱导的分组结构来鉴定可能被单个标记遗漏的常见变体。分析(SMA)。第一步,我们使用LD作为相似性度量,对具有邻接约束的SNP进行分层聚类。在第二步中,我们将模型选择方法应用于获得的层次结构,以定义LD块。最后,我们对推断的LD块执行Group Lasso回归。与最先进的回归方法相比,我们研究了这种方法的效率:单倍型关联测试,SMA,Lasso和Elastic-Net回归。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号