Journal ArticleOPEN ACCESS

G-PRIMER: Greedy algorithm for selecting minimal primer set

Bioinformatics (2004) 20(15) 2473-2475
DOI: 10.1093/bioinformatics/bth259
21Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Wang, J., Li, K. B., & Sung, W. K. (2004). G-PRIMER: Greedy algorithm for selecting minimal primer set. Bioinformatics, 20(15), 2473–2475. https://doi.org/10.1093/bioinformatics/bth259

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free