G-PRIMER：用于选择最小引物集的贪心算法。
G-PRIMER: greedy algorithm for selecting minimal primer set.
作者信息
Wang Jiren, Li Kuo-Bin, Sung Wing-Kin
机构信息
BioInformatics Institute, 30 Biopolis Street, #07-01 Matrix, Singapore 138671.
出版信息
Bioinformatics. 2004 Oct 12;20(15):2473-5. doi: 10.1093/bioinformatics/bth259. Epub 2004 Apr 8.
Abstract
UNLABELLED
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.
AVAILABILITY
It is available at http://mammoth.bii.a-star.edu.sg/gprimer/. Its source code is available upon request.
摘要
未标注
G-PRIMER是一个基于网络的引物设计程序，旨在计算出一套最小化引物集，该引物集能特异性地退火到给定微生物基因组中的所有开放阅读框。该程序已成功应用于微阵列实验，用于分析野油菜黄单胞菌基因组中基因的表达。
Zotero 插件