Integrated minimum-set primers and unique probe design algorithms for differential detection on symptom-related pathogens

MOTIVATION Differential detection on symptom-related pathogens (SRP) is critical for fast identification and accurate control against epidemic diseases. Conventional polymerase chain reaction (PCR) requires a large number of unique primers to amplify selected SRP target sequences. With multiple-use primers (mu-primers), multiple targets can be amplified and detected in one PCR experiment under standard reaction condition and reduced detection complexity. However, the time complexity of designing mu-primers with the best heuristic method available is too vast. We have formulated minimum-set mu-primer design problem as a set covering problem (SCP), and used modified compact genetic algorithm (MCGA) to solve this problem optimally and efficiently. We have also proposed new strategies of primer/probe design algorithm (PDA) on combining both minimum-set (MS) mu-primers and unique (UniQ) probes. Designed primer/probe set by PDA-MS/UniQ can amplify multiple genes simultaneously upon physical presence with minimum-set mu-primer amplification (MMA) before intended differential detection with probes-array hybridization (PAH) on the selected target set of SRP. RESULTS The proposed PDA-MS/UniQ method pursues a much smaller number of primers set compared with conventional PCR. In the simulation experiment for amplifying 12 669 target sequences, the performance of our method with 68% reduction on required mu-primers number seems to be superior to the compared heuristic approaches in both computation efficiency and reduction percentage. Our integrated PDA-MS/UniQ method is applied to the differential detection on 9 plant viruses from 4 genera with MMA and PAH of 11 mu-primers instead of 18 unique ones in conventional PCR while amplifying overall 9 target sequences. The results of wet lab experiments with integrated MMA-PAH system have successfully validated the specificity and sensitivity of the primers/probes designed with our integrated PDA-MS/UniQ method.

[1]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[2]  Konan Peck,et al.  Design and Assessment of A Fast Algorithm for Identifying Specific Probes for Human and Mouse Genes , 2003, Bioinform..

[3]  Matteo Fischetti,et al.  A Heuristic Method for the Set Covering Problem , 1999, Oper. Res..

[4]  David E. Goldberg,et al.  The compact genetic algorithm , 1999, IEEE Trans. Evol. Comput..

[5]  Sven Rahmann,et al.  Mean and variance of the Gibbs free energy of oligonucleotides in the nearest neighbor model under varying conditions , 2004, Bioinform..

[6]  N. Sugimoto,et al.  Improved thermodynamic parameters and helix initiation factor to predict stability of DNA duplexes. , 1996, Nucleic acids research.

[7]  Masahito Yamamoto,et al.  Thermodynamic parameters based on a nearest-neighbor model for DNA sequences with a single-bulge loop. , 2004, Biochemistry.

[8]  N. Gates,et al.  Kinetics of Renaturation of DNA , 2003 .

[9]  Steven Skiena,et al.  Microarray synthesis through multiple-use PCR primer design , 2002, ISMB.

[10]  Fischetti Caprara,et al.  An Indirect Genetic Algorithm for Set Covering Problems , 2002 .

[11]  Xiaowei Wang,et al.  Selection of Oligonucleotide Probes for Protein Coding Sequences , 2003, Bioinform..

[12]  K. Al-Sultan,et al.  A Genetic Algorithm for the Set Covering Problem , 1996 .

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Jain-Shing Wu,et al.  Primer design using genetic algorithm , 2004, Bioinform..

[15]  U Aickelin An indirect genetic algorithm for set covering problems , 2002, J. Oper. Res. Soc..

[16]  D. Lockhart,et al.  Expression monitoring by hybridization to high-density oligonucleotide arrays , 1996, Nature Biotechnology.

[17]  Rolf Niedermeier,et al.  Breakpoint medians and breakpoint phylogenies: A fixed-parameter approach , 2002, ECCB.

[18]  J. Beasley,et al.  A genetic algorithm for the set covering problem , 1996 .