A Greedy Algorithm for Minimizing the Number of Primers in Multiple PCR Experiments

Koichiro Doi (doi@is.s.u-tokyo.ac.jp)
Hiroshi Imai (imai@is.s.u-tokyo.ac.jp)

Department of Information Science, Faculty of Science, University of Tokyo
7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033, Japan


Abstract

The selection of a suitable set of primers is very important for polymerase chain reaction (PCR) experiments. Most existing algorithms for primer selection are concerned with producing a primer pair for each DNA sequence. However, when all the DNA sequences of the target objects are already known, like the approximately 6,000 yeast ORFs, we may want to design a small set of primers to PCR amplify all the targets, which can then be resolved electrophoretically in a series of experiments. This would be quite useful, because decreasing the number of primers greatly reduces the cost of an experiment.

This paper extends the problem of primer selection for a single experiment presented in Doi and Imai to primer selection for multiple PCR experiments, and proposes algorithms for the extended problem. The algorithms design primer sets one at a time. We extend the greedy algorithm for one PCR experiment in by handling amplified segments in DNA sequences that have been identified by primer pairs already selected and by changing the priorities in the greedy algorithm. This algorithm is applied to real yeast data. The number of primers equaled 85% of the number of identified DNA sequences, which represented more than 90% of all the target DNA sequences. This is 42% the number of primers needed for multiplex PCR. Furthermore, the length of each primer is less than half the length of multiplex PCR primers so the cost of producing the primers is reduced to 20% of the cost in the multiplex PCR case.

[ Full-text PDF | Table of Contents ]


Japanese Society for Bioinformatics