An efficient algorithm for minimal primer set selection.
other · Level V
Where this comes from
- Record sourced from PubMed, PMID 12538252.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
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. A free copy of U-PRIMER implemented in C++ programming language is available from http://www.u-vision-biotech.com
Medical subject headings
- Algorithms
- DNA Primers
- Oligonucleotide Array Sequence Analysis
- Reverse Transcriptase Polymerase Chain Reaction
- Sequence Analysis, DNA