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

• Chen, Jianer

published proceedings

• Int J Bioinform Res Appl

author list (cited authors)

• Wu, J., Wang, J., & Chen, J.

citation count

• 6

complete list of authors

• Wu, Jingli||Wang, Jianxin||Chen, Jian'er

publication date

• January 2009

publisher

• Inderscience Publishers  Publisher

published in

• International Journal of Bioinformatics Research and Applications  Journal

keywords

• Algorithms
• Computational Biology
• DNA Primers
• Polymerase Chain Reaction
• Sequence Analysis, DNA

PubMed Central ID

• 19136363

Digital Object Identifier (DOI)

• 10.1504/IJBRA.2009.022462

start page

• 38

end page

• 49

volume

• 5

issue

• 1

URL

• http%3A%2F%2Fdx.doi.org%2F10.1504%2Fijbra.2009.022462