PubMed · 12538252
An efficient algorithm for minimal primer set selection.
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
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ming-Hua Hsieh, Wei-Che Hsu, Sung-Kay Chiu, Chi-Meng Tzeng. 2003-01-22. An efficient algorithm for minimal primer set selection.. https://doi.org/10.1093/bioinformatics%2F19.2.285
Cite the original work for its findings. Save a collection to share your selection of sources.