Abstract
Single Nucleotide Polymorphism (SNP) Genotyping is an important molecular genetics technique in the early stages of producing results that will be useful in the medical field. One of the proposed methods for performing SNP Genotyping requires amplifying regions of DNA surrounding a large number of SNP loci. In order to automate a portion of this method and make the use of SNP Genotyping more widespread, it is important to select a set of primers for the experiment. Selecting these primers can be formulated as the Multiple Degenerate Primer Design (MDPD) problem. An iterative beam-search algorithm, Multiple, Iterative Primer Selector (MIPS), is presented for MDPD. Theoretical and experimental analyses show that this algorithm performs well compared to the limits of degenerate primer design and the number of spurious amplifications should be small. Furthermore, MIPS outperforms an existing algorithm which was designed for a related degenerate primer selection problem.
An implementation of the MIPS algorithm is available for research purposes from the website http://www.cse.wustl.edu/~zhang/software/mips .
We thank Pui Kwok for describing the problem and useful discussions. RS was supported by NIH training grant GM08802 to Washington University Medical School and NSF grant ITR/EIA-0113618, GS was funded by NIH grant HG00249, and WZ was supported by NSF grants IIS-0196057 and ITR/EIA-0113618.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bisiani, R.: Search, beam. In: Shapiro, S.C. (ed.) Encyclopedia of Artificial Intelligence, 2nd edn., pp. 1467–1468. Wiley Interscience, New York (1992)
Collins, F., McKusick, V.: Implications of the human genome project for medical science. JAMA 285, 2447–2448 (2001)
Doi, K., Imai, H.: A greedy algorithm for minimizing the number of primers in multiple pcr experiments. In: Genome Informatics, pp. 73–82 (1999)
Doi, K., Imai, H.: Complexity properties of the primer selection problem for pcr experiments. In: Proceedings of the 5th Japan-Korea Joint Workshop on Algorithms and Computation, pp. 152–159 (2000)
Gabriel, S., Schaffner, S., Nguyen, H., Moore, J., Roy, J., Blumenstiel, B., Higgins, J., DeFelice, M., Lochner, A., Faggart, M., Liu-Cordero, S., Rotimi, C., Adeyemo, A., Cooper, R., Ward, R., Lander, E., Daly, M., Altshuler, D.: The structure of haplotype blocks in the human genome. Science 296, 2225–2229 (2002)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. ch. 15, p. 377. Press Syndicate of the University of Cambridge, Cambridge (1997)
Hertz, G., Stormo, G.: Identifying dna and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics 15, 563–577 (1999)
Kwok, P.: Methods for genotyping single nucleotide polymorphisms. Annu. Rev. Genomics Human Genetics 2, 235–258 (2001)
Kwok, S., Chang, S., Sninsky, J., Wang, A.: A guide to the design and use of mismatched and degenerate primers. PCR Methods and Appl. 3, S39–S47 (1994)
Linhart, C., Shamir, R.: The degenerate primer design problem. Bioinformatics 18(Suppl. 1), S172–S180 (2002)
Marth, G., Yeh, R., Minton, M., Donaldson, R., Li, Q., Duan, S., Davenport, R., Miller, R., Kwok, P.: Single-nucleotide polymorphisms in the public domain: how useful are they? Nature Genetics 27 (2001)
Nicodeme, P., Steyaert, J.-M.: Selecting optimal oligonucleotide primers for multiplex PCR. In: Proceedings of Fifth Conference on Intelligent Systems for Molecular Biology ISMB 1997, pp. 210–213 (1997)
Pearson, W., Robins, G., Wrege, D., Zhang, T.: A new approach to primer selection problem in polymerase chain reaction experiments. In: Third International Conference on Intelligent Systems for Molecular Biology, pp. 285–291. AAAI Press, Menlo Park (1995)
Pearson, W., Robins, G., Wrege, D., Zhang, T.: On the primer selection problem in polymerase chain reaction experiments. Discrete Applied Mathematics 71 (1996)
Waterman, M.S.: Introduction to Computational Biology. Chapman & Hall, Boca Raton (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Souvenir, R., Buhler, J., Stormo, G., Zhang, W. (2003). Selecting Degenerate Multiplex PCR Primers. In: Benson, G., Page, R.D.M. (eds) Algorithms in Bioinformatics. WABI 2003. Lecture Notes in Computer Science(), vol 2812. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39763-2_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-39763-2_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20076-5
Online ISBN: 978-3-540-39763-2
eBook Packages: Springer Book Archive