A practical algorithm for multiplex PCR primer set selection.
A practical algorithm for multiplex PCR primer set selection.
复制标题
DOI：
10.1504/ijbra.2009.022462
复制
发表时间：
2009-01-01
影响因子：
--
通讯作者：
Chen, Jian'er
中科院分区：
文献类型：
--
作者：
Wu, Jingli;Wang, Jianxin;Chen, Jian'er
多重聚合酶链式反应（MP-PCR）实验中，多约束条件下最小引物组的选择是一种有效的方法。然而，没有合适的算法来解决这个问题。本文建立了多约束条件下最小引物集选择问题的数学模型。通过引入一种新的遗传算子，我们开发了一种单亲遗传算法MG-PGA来求解该模型。实验结果表明，MG-PGA不仅可以找到一个小的引物集，但也可以满足多种生物学约束。因此，MG-PGA是MP-PCR引物设计的实用解决方案。
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.