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 1. Solution qualities and performances of several algorithms for set covering problems.      From the results shown in Table 1 it is clear that MCGA is the one with both best performance and best solution qualities. Linear time heuristic has best performance, but the deviation is too large compared to the solutions of other algorithms. With MCGA proved to solve SCP, we applied MCGA to design minimum set multiple-use primers subsequently.