arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0502054cs.DS
收藏

改进的通用阵列标签集设计与复用算法

Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays

Ion I. Mandoiu, Claudia Prajescu, Dragos Trinca

摘要:

在本文中,我们解决了两个优化问题的基因组分析设计的基础上通用标签阵列。首先,我们解决了通用数组标记集的设计问题。对于这个问题,我们扩展以前的配方,将antitag-to-antitag杂交的限制,除了对antitag-to-tag杂交特异性的限制,建立一个建设性的上限上的最大数量的标签满足扩展的限制,并提出了一个简单的贪婪标签选择算法。其次,我们给出了通过结合引物选择和标签分配来提高大规模基因组检测中的多重化率的方法。模拟数据的实验结果表明,这种集成优化导致所需阵列的数量减少高达50%。

英文摘要:

In this paper we address two optimization problems arising in the design of genomic assays based on universal tag arrays. First, we address the universal array tag set design problem. For this problem, we extend previous formulations to incorporate antitag-to-antitag hybridization constraints in addition to constraints on antitag-to-tag hybridization specificity, establish a constructive upper bound on the maximum number of tags satisfying the extended constraints, and propose a simple greedy tag selection algorithm. Second, we give methods for improving the multiplexing rate in large-scale genomic assays by combining primer selection with tag assignment. Experimental results on simulated data show that this integrated optimization leads to reductions of up to 50% in the number of required arrays.

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

↑