首页> 外文期刊>Bioinformatics >An algorithm for learning maximum entropy probability models of disease risk that efficiently searches and sparingly encodes multilocus genomic interactions
【24h】

An algorithm for learning maximum entropy probability models of disease risk that efficiently searches and sparingly encodes multilocus genomic interactions

机译:一种用于学习疾病风险的最大熵概率模型的算法,可以有效地搜索并少量编码多基因座基因组相互作用

获取原文
获取原文并翻译 | 示例
           

摘要

Motivation: In both genome-wide association studies (GWAS) and pathway analysis, the modest sample size relative to the number of genetic markers presents formidable computational, statistical and methodological challenges for accurately identifying markers/interactions and for building phenotype-predictive models.
机译:动机:在全基因组关联研究(GWAS)和途径分析中,相对于遗传标记数量而言适中的样本量为准确识别标记/相互作用和建立表型预测模型提出了巨大的计算,统计和方法挑战。

著录项

  • 来源
    《Bioinformatics》 |2009年第19期|p.2478-2485|共8页
  • 作者单位

    1Department of Electrical Engineering, The Pennsylvania State University, 2Department of Electrical and Computer Engineering, The Virginia Polytechnic Institute and State University, 3Department of Internal Medicine, 4Division of Public Health Sciences, Department of Biostatistical Sciences and 5Division of Public Health Sciences, Department of Epidemiology and Prevention, Wake Forest University;

  • 收录信息 美国《科学引文索引》(SCI);美国《化学文摘》(CA);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号