title: An efficient algorithm for minimal primer set selection.
abstract: CONCLUSIONS
  We have developed U-PRIMER, a primer design program, to compute a minimal primer set (MPS) for any given set of DNA sequences. The U-PRIMER algorithm, which uses automatic variable fixing and automatic redundant constraint elimination to tackle the binary integer programming problem associated with the MPS selection problem. The program has been tested successfully with 32 adipocyte development-related genes and 9 TB-specific genes to obtain their respective MPSs.
  
  
  BACKGROUND
  A free copy of U-PRIMER implemented in C++ programming language is available from http://www.u-vision-biotech.com
authors.affiliation: Department of Research and Development, U-Vision Biotech Inc., 3F 132, Ln 235, Pao-Chiao Rd, Hsin-Tien City 231 Taipei, Taiwan.
authors.forename: Ming-Hua
authors.initials: MH
authors.lastname: Hsieh
authors.forename: Wei-Che
authors.initials: WC
authors.lastname: Hsu
authors.forename: Sung-Kay
authors.initials: SK
authors.lastname: Chiu
authors.forename: Chi-Meng
authors.initials: CM
authors.lastname: Tzeng
mesh_terms: D017667:Adipocytes / Q000166:cytology; D000465:Algorithms; D002454:Cell Differentiation / Q000235:genetics; D017931:DNA Primers; D009169:Mycobacterium tuberculosis / Q000235:genetics; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods*; D011786:Quality Control; D020133:Reverse Transcriptase Polymerase Chain Reaction / Q000379:methods*; D016415:Sequence Alignment / Q000379:methods; D017422:Sequence Analysis, DNA / Q000379:methods*
chemical_list: D017931:DNA Primers