MCMC-ODPR: Primer design optimization using Markov Chain Monte Carlo sampling

BackgroundNext generation sequencing technologies often require numerous primer designs that require good target coverage that can be financially costly. We aimed to develop a system that would implement primer reuse to design degenerate primers that could be designed around SNPs, thus find the fewest necessary primers and the lowest cost whilst maintaining an acceptable coverage and provide a cost effective solution. We have implemented Metropolis-Hastings Markov Chain Monte Carlo for optimizing primer reuse. We call it the Markov Chain Monte Carlo Optimized Degenerate Primer Reuse (MCMC-ODPR) algorithm.ResultsAfter repeating the program 1020 times to assess the variance, an average of 17.14% fewer primers were found to be necessary using MCMC-ODPR for an equivalent coverage without implementing primer reuse. The algorithm was able to reuse primers up to five times. We compared MCMC-ODPR with single sequence primer design programs Primer3 and Primer-BLAST and achieved a lower primer cost per amplicon base covered of 0.21 and 0.19 and 0.18 primer nucleotides on three separate gene sequences, respectively. With multiple sequences, MCMC-ODPR achieved a lower cost per base covered of 0.19 than programs BatchPrimer3 and PAMPS, which achieved 0.25 and 0.64 primer nucleotides, respectively.ConclusionsMCMC-ODPR is a useful tool for designing primers at various melting temperatures at good target coverage. By combining degeneracy with optimal primer reuse the user may increase coverage of sequences amplified by the designed primers at significantly lower costs. Our analyses showed that overall MCMC-ODPR outperformed the other primer-design programs in our study in terms of cost per covered base.

[1]  W. Ian Lipkin,et al.  Greene SCPrimer: a rapid comprehensive tool for designing degenerate primers from multiple sequence alignments , 2006, Nucleic acids research.

[2]  Ron Shamir,et al.  The Degenerate Primer Design Problem , 2002, ISMB.

[3]  Doi,et al.  A Greedy Algorithm for Minimizing the Number of Primers in Multiple PCR Experiments. , 1999, Genome informatics. Workshop on Genome Informatics.

[4]  Hamed Shateri Najafabadi,et al.  Designing multiple degenerate primers via consecutive pairwise alignments , 2008, BMC Bioinformatics.

[5]  Yu-Tseung Liu,et al.  A Novel Approach for Determining Cancer Genomic Breakpoints in the Presence of Normal DNA , 2007, PloS one.

[6]  Simon Kasif,et al.  MuPlex: multi-objective multiplex PCR assay design , 2005, Nucleic Acids Res..

[7]  BMC Bioinformatics , 2005 .

[8]  S Rozen,et al.  Primer3 on the WWW for general users and for biologist programmers. , 2000, Methods in molecular biology.

[9]  Weixiong Zhang,et al.  An iterative method for selecting degenerate multiplex PCR primers. , 2007, Methods in molecular biology.

[10]  E. Myers,et al.  Basic local alignment search tool. , 1990, Journal of molecular biology.

[11]  Yaqin Ma,et al.  BatchPrimer3: A high throughput web application for PCR and sequencing primer design , 2008, BMC Bioinformatics.

[12]  Bradley P. Carlin,et al.  Markov Chain Monte Carlo conver-gence diagnostics: a comparative review , 1996 .

[13]  S. Rajasekaran,et al.  An Efficient Algorithm for Minimum Degeneracy Primer Selection , 2007, IEEE Transactions on NanoBioscience.

[14]  Jian Ye,et al.  Primer-BLAST: A tool to design target-specific primers for polymerase chain reaction , 2012, BMC Bioinformatics.