Please use this identifier to cite or link to this item: https://doi.org/10.1093/bioinformatics/bth259
DC FieldValue
dc.titleG-PRIMER: Greedy algorithm for selecting minimal primer set
dc.contributor.authorWang, J.
dc.contributor.authorLi, K.-B.
dc.contributor.authorSung, W.-K.
dc.date.accessioned2013-07-04T07:50:44Z
dc.date.available2013-07-04T07:50:44Z
dc.date.issued2004
dc.identifier.citationWang, 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
dc.identifier.issn13674803
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/39838
dc.description.abstractSummary: 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1093/bioinformatics/bth259
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1093/bioinformatics/bth259
dc.description.sourcetitleBioinformatics
dc.description.volume20
dc.description.issue15
dc.description.page2473-2475
dc.description.codenBOINF
dc.identifier.isiut000224481900022
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

20
checked on May 19, 2020

WEB OF SCIENCETM
Citations

15
checked on May 12, 2020

Page view(s)

127
checked on May 12, 2020

Google ScholarTM

Check

Altmetric


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