Minimum Set Primers and Unique Probes Design Algorithms for
Differential Detection of Symptom-Related Pathogens
HOME | |
Introduction | |
Methodology | |
Computational Results | |
MCGA for Set Covering Problem | |
MCGA for Primer design | |
Bio-Experiment | |
Conclusion | |
Reference |
Table 2. Comparison of primer reduction among two heuristics and MCGA.
a Implemented as described by (Fernandes and Skiena, 2002) . b Number of genes which can be amplified with appropriate primer pairs. c Percent of reduced primers, averaged over 30 repeated runs.
The comparison among LTH, DSH, and MCGA is made in a Pentium 4 2.6 GHz PC running Linux operating system. The melting temperature range for the genome-wide PCR primers is 37~ 43 °C . Each of the three methods have been repeated 30 times. The results average over 30 runs. The average reduction rates, standard deviations, and average time used are summarized in Table 2. From Table 2 we can see that LTH is the fastest algorithm among the three. MCGA is slower than LTH but faster than DSH over an order of magnitude. The primer reduction rates of DSH and MCGA are comparable, both much better than that of LTH. In the case of Ciona intestinalis , DSH reduced 63.98% of the primers, whereas MCGA reduced 68% of the primers required to amplify 12,669 sequences. MCGA only uses 2.68% of the time used by DSH algorithm. That is, comparing to DSH MCGA saved more than 5 days when applied to Ciona intestinalis . According to these results, we can conclude that MCGA is agood balance achieving both performance and solution quality. The solution quality of MCGA is much better than that of LTH. With higher performance than and comparable reduction rate to DSH, MCGA is a good alternative to the two heuristics for the design of multiple-use and minimum set primers. |