首页> 外文会议>International workshop on algorithms in bioinformatics >An LP-Rounding Algorithm for Degenerate Primer Design
【24h】

An LP-Rounding Algorithm for Degenerate Primer Design

机译:用于简并引物设计的LP舍入算法

获取原文

摘要

In applications where a collection of similar sequences needs to be amplified through PCR, degenerate primers can be used to improve the efficiency and accuracy of amplification. Conceptually, a degenerate primer is a sequence in which some bases are ambiguous, in the sense that they can bind to more than one nucleotide. These ambiguous bases allow degenerate primers to bind to multiple target sequences. When designing degenerate primers, it is essential to find a good balance between high coverage (the number of amplified target sequences) and low degeneracy. In this paper, we propose a new heuristic, called RRD2P, for computing a pair of forward and reverse primers with near-optimal coverage, under the specified degeneracy threshold. The fundamental idea of our algorithm is to represent computing optimal primers as an integer linear program, solve its fractional relaxation, and then apply randomized rounding to compute an integral solution. We tested Algorithm RRD2P on three biological data sets, and our experiments confirmed that it produces primer pairs with good coverage, comparing favorably with a similar tool called HYDEN.
机译:在需要通过PCR扩增一系列相似序列的应用中,简并引物可用于提高扩增效率和准确性。从概念上讲,简并引物是其中某些碱基不明确的序列,即它们可以与一个以上的核苷酸结合。这些模棱两可的碱基使简并引物与多个靶序列结合。设计简并引物时,必须在高覆盖率(扩增的靶序列数量)和低简并性之间找到良好的平衡。在本文中,我们提出了一种新的启发式方法,称为RRD2P,用于在指定的简并阈值下计算一对具有接近最佳覆盖范围的正向和反向引物。我们算法的基本思想是将计算最佳引物表示为整数线性程序,求解其分数弛豫,然后应用随机舍入法计算积分解。我们在三个生物学数据集上测试了算法RRD2P,我们的实验证实,它产生的引物对具有良好的覆盖率,与类似的工具HYDEN相比具有优势。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号