z-logo
open-access-imgOpen Access
G-PRIMER: greedy algorithm for selecting minimal primer set
Author(s) -
Jiren Wang,
Kuo-Bin Li,
WingKin Sung
Publication year - 2004
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/bth259
Subject(s) - primer (cosmetics) , computer science , genome , computational biology , set (abstract data type) , source code , code (set theory) , genetics , biology , programming language , gene , chemistry , organic chemistry
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom