| Article ID: | iaor2005225 |
| Country: | United States |
| Volume: | 19 |
| Issue: | 2 |
| Start Page Number: | 285 |
| End Page Number: | 286 |
| Publication Date: | Jan 2003 |
| Journal: | Bioinformatics |
| Authors: | Hsieh M.H., Hsu W.C., Chiu S.K., Tzeng C.M. |
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, 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 hftp://www.u-vision-biotech.com. Contact: cmtzeng@u-vision.biotech.com.