首页> 外文期刊>Journal of Bioinformatics and Computational Biology >Fast Large Scale Oligonucleotide Selection Using the Longest Common Factor Approach
【24h】

Fast Large Scale Oligonucleotide Selection Using the Longest Common Factor Approach

机译:使用最长公因子方法的快速大规模大规模寡核苷酸选择

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

摘要

We present a fast method that selects oligonucleotide probes (such as DNA 25-mers) for microarray experiments on a truly large scale. For example, reliable oligos for human genes can be found within four days, a speedup of one to two orders of magnitude compared to previous approaches. This speed is attained by using the longest common substring as a specificity measure for candidate oligos. We present a space- and time-efficient algorithm, based on a suffix array with additional information, to compute matching statistics (lengths of longest matches) between all candidate oligos and all remaining sequences. With the matching statistics available, we show how to incorporate constraints such as oligo length, melting temperature, and self-complementarity into the selection process at a postprocessing stage. As a result, we can now design custom oligos for any sequenced genome, just as the technology for on-site chip synthesis is becoming increasingly mature.
机译:我们提出了一种快速选择寡核苷酸探针(例如DNA 25-mers)用于大规模实验的快速方法。例如,可以在四天之内找到可靠的人类基因寡核苷酸,与以前的方法相比,加速了一到两个数量级。通过使用最长的公共子串作为候选寡核苷酸的特异性度量,可以达到该速度。我们基于带有附加信息的后缀数组提出一种节省时间和空间的算法,以计算所有候选寡核苷酸和所有其余序列之间的匹配统计信息(最长匹配的长度)。利用可用的匹配统计数据,我们展示了如何在后处理阶段将诸如寡核苷酸长度,解链温度和自互补性等约束条件纳入选择过程。结果,正如现场芯片合成技术日趋成熟一样,我们现在可以为任何测序的基因组设计定制的寡核苷酸。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号