首页> 外文会议>International Conference on Theory and Applications of Satisfiability Testing - SAT >SAT in Bioinformatics: Making the Case with Haplotype Inference
【24h】

SAT in Bioinformatics: Making the Case with Haplotype Inference

机译:坐在生物信息学中:用单倍型推理制作这种情况

获取原文

摘要

Mutation in DNA is the principal cause for differences among human beings, and Single Nucleotide Polymorphisms (SNPs) are the most common mutations. Hence, a fundamental task is to complete a map of haplotypes (which identify SNPs) in the human population. Associated with this effort, a key computational problem is the inference of haplotype data from genotype data, since in practice genotype data rather than haplotype data is usually obtained. Recent work has shown that a SAT-based approach is by far the most efficient solution to the problem of haplotype inference by pure parsimony (HIPP), being several orders of magnitude faster than existing integer linear programming and branch and bound solutions. This paper proposes a number of key optimizations to the the original SAT-based model. The new version of the model can be orders of magnitude faster than the original SAT-based HIPP model, particularly on biological test data.
机译:DNA中的突变是人类差异的主要原因,单核苷酸多态性(SNP)是最常见的突变。因此,基本任务是在人口中完成单倍型(鉴定SNPS)的地图。与此努力相关联,关键计算问题是从基因型数据引起单倍型数据,因为在实践基因型数据而不是单倍型数据中通常获得。最近的工作表明,基于SAT的方法是纯粹的Parsimony(HIPP)对单倍型推断问题的最有效的解决方案,比现有整数线性编程和分支和绑定解决方案更快的数量级。本文提出了对原始SAT的模型的许多关键优化。该模型的新版本可以比原始SAT的HIPP模型更快,特别是在生物学测试数据上。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号