Bioinformatics Advance Access originally published online on April 8, 2004
Bioinformatics 2004 20(15):2473-2475; doi:10.1093/bioinformatics/bth259
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Bioinformatics 20(15) © Oxford University Press 2004; all rights reserved.
Applications Note |
G-PRIMER: greedy algorithm for selecting minimal primer set
1 BioInformatics Institute, 30 Biopolis Street, #07-01 Matrix, Singapore 138671 and 2 Department of Computer Science, National University of Singapore, 3 Science Drive 2, Singapore 117543
Received on January 25, 2004; revised on February 27, 2004; accepted on March 9, 2004
Advance Access Publication April 8, 2004
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.
Availability: It is available at http://mammoth.bii.a-star.edu.sg/gprimer/. Its source code is available upon request.
Contact: jiren{at}bii.a-star.edu.sg