Selecting degenerate multiplex PCR primers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2812, Issue , 2003, Pages 512-526

  Souvenir, Richard ^a   Buhler, Jeremy ^a,b   Stormo, Gary ^a,b   Zhang, Weixiong ^a,b  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

^b WASHINGTON UNIVERSITY SCHOOL OF MEDICINE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MOLECULAR BIOLOGY; POLYMERASE CHAIN REACTION;

BEAM SEARCH ALGORITHMS; DEGENERATE PRIMERS; EXPERIMENTAL ANALYSIS; MEDICAL FIELDS; MOLECULAR GENETICS; RESEARCH PURPOSE; SELECTION PROBLEMS; SINGLE-NUCLEOTIDE POLYMORPHISMS;

ITERATIVE METHODS;

EID: 35248865386     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39763-2_36     Document Type: Article

References (16)

1. R. Bisiani. Search, beam. In S. C. Shapiro, editor, Encyclopedia of Artificial Intelligence, pages 1467-1468. Wiley-Interscience, New York, NY, 2nd edition, 1992.
2. F. Collins and V. McKusick. Implications of the human genome project for medical science. JAMA, 285:2447-2448, 2001.
3. K. Doi and H. Imai. A greedy algorithm for minimizing the number of primers in multiple pcr experiments. Genome Informatics, pages 73-82, 1999.
4. K. Doi and H. Imai. Complexity properties of the primer selection problem for per experiments. In Proceedings of the 5th Japan-Korea Joint Workshop on Algorithms and Computation, pages 152-159, 2000.
5. S. Gabriel, S. Schaffner, H. Nguyen, J. Moore, J. Roy, B. Blumenstiel, J. Higgins, M. DeFelice, A. Lochner, M. Faggart, S. Liu-Cordero, C. Rotimi, A. Adeyemo, R. Cooper, R. Ward, E. Lander, M. Daly, and D. Altshuler. The structure of haplotype blocks in the human genome. Science, 296:2225-2229, 2002.
6. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, NY, 1979.
7. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, chapter 15, page 377. Press Syndicate of the University of Cambridge, 1997.
8. G. Hertz and G. Stormo. Identifying dna and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics, 15:563-577, 1999.
9. P. Kwok. Methods for genotyping single nucleotide polymorphisms. Annu. Rev. Genomics Human Genetics, 2:235-58, 2001.
10. S. Kwok, S. Chang, J. Sninsky, and A. Wang. A guide to the design and use of mismatched and degenerate primers. PCR Methods and Appl., 3:S39-S47, 1994.
11. C. Linhart and R. Shamir. The degenerate primer design problem. Bioinformatics, 18, Suppl. 1:S172-S180, 2002.
12. G. Marth, R. Yeh, M. Minton, R. Donaldson, Q. Li, S. Duan, R. Davenport, R. Miller, and P. Kwok. Single-nucleotide polymorphisms in the public domain: how useful are they? Nature Genetics, 27, 2001.
13. P. Nicodeme and J.-M. Steyaert. Selecting optimal oligonucleotide primers for multiplex PCR. In Proceedings of Fifth Conference on Intelligent Systems for Molecular Biology ISMB97, pages 210-213, 1997.
14. W. Pearson, G. Robins, D. Wrege, and T. Zhang. A new approach to primer selection problem in polymerase chain reaction experiments. In Third International Conference on Intelligent Systems for Molecular Biology, pages 285-291. AAAI Press, 1995.
15. W. Pearson, G. Robins, D. Wrege, and T. Zhang. On the primer selection problem in polymerase chain reaction experiments. Discrete Applied Mathematics, 71, 1996.
16. M. S. Waterman. Introduction to Computational Biology. Chapman & Hall, 1995.