On the primer selection problem in polymerase chain reaction experiments

Discrete Applied Mathematics

Volumn 71, Issue 1-3, 1996, Pages 231-246

  Pearson, William R ^a   Robins, Gabriel ^b   Wrege, Dallas E ^b   Zhang, Tongtong ^b  

^a UNIVERSITY OF VIRGINIA   (United States)

^b University of Virginia   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001781529     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00066-2     Document Type: Article

References (13)

1. N. Arnheim, H. Li and X. Cui, PCR analysis of DNA sequences in single cells: single sperm gene mapping and genetic disease diagnosis, Genomics 8 (1990) 415-419.
2. R. Bar-Yehuda and S. Even, A linear-time approximation algorithm for the weighted vertex cover problem, J. Algorithms 2 (1981) 199-203.
3. V. Chvatal, A greedy heuristic for the set-covering problem, Math. Oper. Res. 4 (1979) 233-235.
4. T.H. Cormen, C.E. Leiserson and R. Rivest, Introduction to algorithms (MIT Press, Cambridge, MA, 1990).
5. H.A. Erlich, D. Gelfand and J.J. Sninsky, Recent advances in the polymerase chain reaction, Science 252 (1991) 1643-1651.
6. J.K. Harrison, W.R. Pearson and K.R. Lynch, Molecular characterization of alpha-1 and alpha-2 adrenoceptors, Trends Pharm. Sci. 12 (1991) 62-67.
7. L. Hillier and P. Green, OSP: a computer program for choosing PCR and DNA sequencing primers, PCR Methods Appl. 1 (1991) 124-128.
8. D.S. Johnson, On the ratio of optimal integral and fractional covers, J. Comput. System Sci. 9 (1974) 256-278.
9. L. Lovasz, On the ratio of optimal integral and fractional covers, Discrete Math. 13 (1975) 383-390.
10. T. Lowe, J. Sharefkin, S.Q. Yang and C.W. Dieffenbach, A computer program for selection of oligonucleotide primers for polymerase chain reactions, Nucl. Acids Res. 18 (1990) 1757-1761.
11. K. Lucas, M. Busch, S. Mossinger and J.A. Thompson, An improved microcomputer program for finding gene-or gene family-specific oligonucleotides suitable as primers for polymerase chain reactions or as probes, Comp. Appl. Biosci. 7 (1991) 525-529.
12. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Proc. ACM Symp. Theory Comput. 25 (1993) 286-293.
13. W.R. Pearson, G. Robins, D.E. Wrege and T. Zhang, New approach to primer selection in polymerase chain reaction experiments, in: Proceedings of the International Conference on the Intelligent Systems for Molecular Biology, Cambridge (1995) 285-291.