Please use this identifier to cite or link to this item: https://doi.org/10.1093/bioinformatics/bth259
Title: G-PRIMER: Greedy algorithm for selecting minimal primer set
Authors: Wang, J.
Li, K.-B.
Sung, W.-K. 
Issue Date: 2004
Source: Wang, J., Li, K.-B., Sung, W.-K. (2004). G-PRIMER: Greedy algorithm for selecting minimal primer set. Bioinformatics 20 (15) : 2473-2475. ScholarBank@NUS Repository. https://doi.org/10.1093/bioinformatics/bth259
Abstract: Summary: 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. © Oxford University Press 2004; all rights reserved.
Source Title: Bioinformatics
URI: http://scholarbank.nus.edu.sg/handle/10635/39838
ISSN: 13674803
DOI: 10.1093/bioinformatics/bth259
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

19
checked on Dec 11, 2017

WEB OF SCIENCETM
Citations

15
checked on Dec 11, 2017

Page view(s)

75
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.