arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.3528q-bio.GNcs.LGstat.ML
收藏

一种有效的识别具有临床意义的遗传变异的充分降维方法

An Efficient Sufficient Dimension Reduction Method for Identifying Genetic Variants of Clinical Significance

The University of Texas School of Public Health(德克萨斯大学公共卫生学院)

Momiao Xiong, Long Ma

摘要:

快速和更便宜的下一代测序技术将产生前所未有的大规模和高维度的基因组和表观基因组变异数据。在不久的将来,医疗记录的常规部分将包括测序的基因组。一个基本的问题是如何有效地提取临床实用的基因组和表观基因组变体,这将为最佳健康和干扰策略提供信息。用于识别临床有效性的变体的传统范例是测试变体的关联。然而,显著相关的遗传变异可能对疾病的诊断和预后有用,也可能没用。寻找预测效用的遗传变异的关联研究的替代方法是系统地搜索包含足够的表型预测信息的变异。为了实现这一目标,我们引入了足够的降维和坐标假设的概念,将原始的高维数据投影到非常低维的空间,同时保留所有关于响应表型的信息。然后,我们制定了临床上显着的遗传变异发现问题稀疏SDR问题,并开发算法,可以选择显着的遗传变异,从高达甚至千万的预测与SDR的帮助下,为整个基因组划分成一些subSDR问题定义的基因组区域。稀疏SDR反过来被公式化为稀疏最优评分问题,但具有可以从基矩阵中移除行向量的惩罚。为了加快计算速度,我们提出了一种改进的交替方向乘子法来求解稀疏最优评分问题,该方法易于并行实现。为了说明其应用,将所提出的方法应用于模拟数据和NHLBI的外显子组测序项目数据集

英文摘要:

Fast and cheaper next generation sequencing technologies will generate unprecedentedly massive and highly-dimensional genomic and epigenomic variation data. In the near future, a routine part of medical record will include the sequenced genomes. A fundamental question is how to efficiently extract genomic and epigenomic variants of clinical utility which will provide information for optimal wellness and interference strategies. Traditional paradigm for identifying variants of clinical validity is to test association of the variants. However, significantly associated genetic variants may or may not be usefulness for diagnosis and prognosis of diseases. Alternative to association studies for finding genetic variants of predictive utility is to systematically search variants that contain sufficient information for phenotype prediction. To achieve this, we introduce concepts of sufficient dimension reduction and coordinate hypothesis which project the original high dimensional data to very low dimensional space while preserving all information on response phenotypes. We then formulate clinically significant genetic variant discovery problem into sparse SDR problem and develop algorithms that can select significant genetic variants from up to or even ten millions of predictors with the aid of dividing SDR for whole genome into a number of subSDR problems defined for genomic regions. The sparse SDR is in turn formulated as sparse optimal scoring problem, but with penalty which can remove row vectors from the basis matrix. To speed up computation, we develop the modified alternating direction method for multipliers to solve the sparse optimal scoring problem which can easily be implemented in parallel. To illustrate its application, the proposed method is applied to simulation data and the NHLBI's Exome Sequencing Project dataset

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑