An efficient algorithm for minimal primer set selection |
| |
| Authors: | Hsieh Ming-Hua Hsu Wei-Che Chiu Sung-Kay Tzeng Chi-Meng |
| |
| Affiliation: | Department of Research and Development, U-Vision Biotech Inc., 3F 132, Ln 235, Pao-Chiao Rd, Hsin-Tien City 231 Taipei, Taiwan. |
| |
| Abstract: | SUMMARY: 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. AVAILABILITY: A free copy of U-PRIMER implemented in C++ programming language is available from http://www.u-vision-biotech.com |
| |
| Keywords: | |
| 本文献已被 PubMed 等数据库收录！ |
|
