Designing Multiple-Use Primer Set for Multiplex PCR by Using Compact GAs

  • Yu-Cheng Huang
  • Han-Yu Chuang
  • Huai-Kuang Tsai
  • Chun-Fan Chang
  • Cheng-Yan Kao
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3242)

Abstract

Reducing the number of needed primers in multiplex polymerase chain reaction experiments is useful, or even essential, in large scale genomic research. In this paper, we transform this multiple-use primer design problem into a set-covering problem, and propose a modified compact genetic algorithm (MCGA) approach to disclose optimal solutions. Our experimental results demonstrate that MCGA effectively reduces the primer numbers of multiplex PCR experiments among whole-genome data sets of four test species within a feasible computation time, especially when applied on complex genomes. Moreover, the performance of MCGA further exhibits better global stability of optimal solutions than conventional heuristic methods that may fall into local optimal traps.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bej, A.K., Mahbubani, M.H., Atlas, R.M.: Amplification of nucleic acids by polymerase chain reaction (PCR) and other methods and their applications. Critical Reviews in Biochemistry and Molecular Biology 26, 301–334 (1991)CrossRefGoogle Scholar
  2. 2.
    Wang, J., Hu, L., Hamilton, S.R., Coombes, K.R., Zhang, W.: RNA amplification strategies for cDNA microarray experiments. BioTechniques 34, 394–400 (2003)Google Scholar
  3. 3.
    Wenijn, S., Siyang, S., Minnan, L., Guangming, L.: Multiplex polymerase chain reaction/ membrane hybridization assay for detection of genetically modified organisms. J. Bio-technology 105(3), 227–233 (2003)Google Scholar
  4. 4.
    Chamberlain, J.S., Gibbs, R.A., Ranier, J.E., Nguyen, P.N., Caskey, C.T.: Deletion screening of the duchenne muscular dystrophy locus via multiplex DNA amplification. Nucleic Acids Research 16, 11141–11156 (1988)CrossRefGoogle Scholar
  5. 5.
    Mitsuhashi, M., Cooper, A., Ogura, M., Shinagawa, T., Yano, K., Hosokawa, T.: Oligonucleotide probe design – a new approach. Nature 367, 759–761 (1994)CrossRefGoogle Scholar
  6. 6.
    Lowe, T., Sharefkin, J., Yan, S.Q., Dieffenbach, C.W.: A computer program for selection of oligonucleotide primers for polymerase chain reactions. Nucleic Acids Research 18, 1757–1761 (1990)CrossRefGoogle Scholar
  7. 7.
  8. 8.
    Welsh, J., McClelland, M.: Fingerprinting genomes using PCR with arbitrary primers. Nucleic Acids Research 18, 7213–7218 (1990)CrossRefGoogle Scholar
  9. 9.
    Rohan, J.F., Steven, S.S.: Microarray synthesis through multiple-use PCR primer design. Bioinformatics 18, S128–S135 (2002)Google Scholar
  10. 10.
    William, R.P., Gabriel, R., Dallas, E.W., Tongtong, Z.: On the primer selection problem in polymerase chain reaction experiments. Discrete Applied Mathematics 71(1-3), 231–246 (1996)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Srinivas, N., Deb, K.: Multi-Objective function optimization using non-dominated sorting genetic algorithms. Evolutionary Computation 2, 221–248 (1995)CrossRefGoogle Scholar
  12. 12.
    Jayalakshmi, G.A., Sathiamoorthy, S., Rajaram, R.: A Hybrid Genetic Algorithm – A New Approach To Solve Traveling Salesman Problem. International Journal of Computational Engineering Science 2, 339–355 (2001)CrossRefGoogle Scholar
  13. 13.
    Aickelin, U.: An indirect genetic algorithm for set covering problems. Journal of Operational Research Society 50(10), 1118–1126 (2002)Google Scholar
  14. 14.
    Harik, G.R., Lobo, F.G., Goldberg, D.E.: The compact genetic algorithm. IEEE Transactions on Evolutionary Computation 3, 287–297 (1999)CrossRefGoogle Scholar
  15. 15.
    Garey, M., Johnson, D.: Computers and Intractability: A guide to the theory of NPcompleteness. W. H. Freeman, San Francisco (1979)Google Scholar
  16. 16.
    Gonzalez, B., Hector, Latombe, Jean, C.: A randomized art-gallery algorithm for sensor placement. In: Proc. of the 17th annual symposium on Computational Geometry (2002) Google Scholar
  17. 17.
    Karp, R.M.: Mapping the genome: some combinatorial problems arising in molecular biology. In: Proceedings of the 25th annual ACM symposium on Theory of Computing (1993) Google Scholar
  18. 18.
    Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Operations Research 47, 730–743 (1999)MATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Caprara, A., Fischetti, M., Toth, P.: Algorithms for the set covering problem. working paper, DEIS. University of Bologna, Italy (1999)Google Scholar
  20. 20.
    Srinivas, M., Patnaik, L.M.: Genetic algorithms: A survey. Computer Journal 27, 17–26 (1994)Google Scholar
  21. 21.
    Beasley, J.: OR-library: distributing test problems by electronic mail. Journal of the Operational Research Society 41, 1069–1072 (1990)Google Scholar
  22. 22.
    Beasley, J., Chu, P.: A genetic algorithm for the set covering problem. European Journal of Operational Research 94, 392–404 (1996)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Yu-Cheng Huang
    • 1
  • Han-Yu Chuang
    • 1
  • Huai-Kuang Tsai
    • 1
  • Chun-Fan Chang
    • 2
  • Cheng-Yan Kao
    • 1
  1. 1.Dept. of Computer Science and Information EngineeringNational Taiwan UniversityTaiwan
  2. 2.Chinese Culture UniversityTaiwan

Personalised recommendations