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

We have tested the capability of MCGA in solving set covering (SCP) problems by comparing it to several other algorithms. These algorithms have been applied to several standard benchmark SCP problems (Beasley, 1990) for evaluation of relative performances and solution qualities. Also, we applied MCGA to the design of minimum set primers, and compared our method with two other heuristics, Linear Time Heuristic (LTH) and Densest Subgraph Heuristics (DSH) (Fernandes and Skiena, 2002) . The two heuristics have different purposes. LTH can reduce the primer set in linear time, but the reduction is not as good as DSH. Moreover, the time complexity of DSH is much higher than LTH. Our results will illustrate that our method is much faster than DSH and the reduction rate is higher than LTH.