An efficient algorithm for minimal primer set selection | Zendy

MingHua Hsieh | Zendy; Wei-Che Hsu | Zendy; Sung-Kay Chiu | Zendy; Chi-Meng Tzeng | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An efficient algorithm for minimal primer set selection

Author(s) -

MingHua Hsieh,

Wei-Che Hsu,

Sung-Kay Chiu,

Chi-Meng Tzeng

Publication year - 2003

Publication title -

bioinformatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.599

H-Index - 390

eISSN - 1367-4811

pISSN - 1367-4803

DOI - 10.1093/bioinformatics/19.2.285

Subject(s) - primer (cosmetics) , computer science , set (abstract data type) , constraint (computer aided design) , selection (genetic algorithm) , integer programming , algorithm , integer (computer science) , computational biology , programming language , biology , mathematics , artificial intelligence , chemistry , geometry , organic chemistry

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research