G-PRIMER: greedy algorithm for selecting minimal primer set

G-PRIMER: greedy algorithm for selecting minimal primer set
复制标题

DOI:
10.1093/bioinformatics/bth259
复制
发表时间:
2004-10-12
期刊:
影响因子:
5.8
通讯作者:
Sung, WK
Sung, WK
中科院分区:
生物学3区
文献类型:
--
作者:
Wang, J;Li, KB;Sung, WK

文献摘要

被引文献

相似文献

G-PRIMER 是一种基于网络的引物设计程序,旨在计算专门退火到给定微生物基因组中所有开放阅读框的最小引物集。该程序已成功用于分析黄单胞菌基因组中基因表达的微阵列实验。
G-PRIMER, a web-based primer design program, has been developed to compute a minimal primer set specifically annealed to all the open reading frames in a given microbial genome. This program has been successfully used in the microarray experiment for analyzing the expression of genes in the Xanthomonas campestris genome.