• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Electronic Computer Technology >Integer Linear Programming in Designing Universal Arrays with Multiplexed Applications
【24h】

Integer Linear Programming in Designing Universal Arrays with Multiplexed Applications

机译：设计具有多路复用应用的通用阵列的整数线性编程

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Single Nucleotide Polymorphisms (SNPs) are variations in a single nucleotide within a generally conserved genomic sequence across the population. SNPs can be genotyped using a universal DNA tag array. But cross-hybridization involving assay-specific components disrupts this process. The problem of identifying the most economic experimental configuration of the assay specific components that avoids cross-hybridization can be formulated as an optimization problem. More specifically, the problem translates into the problem of covering the vertices of one side of a bipartite graph by a minimum number of balanced subgraphs of maximum degree one. The problem was shown to be NP-complete by Ben-Dor et. al. [1]. In this paper, we give integer linear programming formulation of this problem. We also provide an integer linear programming formulation of a mathematically related problem.
机译：单核苷酸多态性（SNP）是在群体中通常保守的基因组序列内的单个核苷酸的变化。 SNP可以使用通用DNA标签阵列进行基因分型。但是涉及测定特异性组件的交叉杂交扰乱了这一过程。确定避免交叉杂交的测定特定组分的最经济实验配置的问题可以制定为优化问题。更具体地，问题转化为通过最大程度的最小平衡子图覆盖二分曲线图的一侧的顶点的问题。该问题显示由Ben-Dor Et进行NP-Creating。 al。 [1]。在本文中，我们给出了整数线性编程制定这个问题。我们还提供了数学上相关问题的整数线性编程配方。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号