title: A practical algorithm for multiplex PCR primer set selection.
abstract: Selecting the minimum primer set with multiple constraints is an effective method for a successful and economical Multiplex Polymerase Chain Reaction (MP-PCR) experiment. However, there is no suitable algorithm for solving the problem. In this paper, a mathematical model is presented for the minimum primer set selection problem with multiple constraints. By introducing a novel genetic operator, we developed a parthenogenetic algorithm MG-PGA to solve the model. Experimental results show that MG-PGA can not only find a small primer set, but can also satisfy multiple biological constraints. Therefore, MG-PGA is a practical solution for MP-PCR primer design.
authors.affiliation: School of Information Science and Engineering, Central South University, Changsha 410083, China. wjlhappy@mailbox.gxnu.edu.cn
authors.forename: Jingli
authors.initials: J
authors.lastname: Wu
authors.forename: Jianxin
authors.initials: J
authors.lastname: Wang
authors.forename: Jian'er
authors.initials: J
authors.lastname: Chen
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods; D017931:DNA Primers / Q000737:chemistry*; D016133:Polymerase Chain Reaction / Q000379:methods*; D017422:Sequence Analysis, DNA / Q000379:methods
chemical_list: D017931:DNA Primers