Abstract
Degenerate primers are used to amplify a given set of genomic sequences using a technique called Multiplex Polymerase Chain Reaction (MP-PCR). The problem of minimizing the number of degenerate primers required to amplify a given set of DNA sequences, also known as the Degenerate Primer Design Problem (DPDP), has been extensively studied in the literature and proven to be NP-Complete. In this paper we present efficient algorithms for solving DPDP. For example, one of the algorithms we give in this paper is iterative and has a runtime of O(b|Σ|log|Σ|dn2mp) to select a set of p degenerate primers, each of given length l and degeneracy at most d, for n sequences each of length m in the input, the number of candidates retained in each iteration being b. Σ is the alphabet of the input strings. This is an improvement over the runtime of the best known prior algorithm, MIPS by Souvenir et al. [15], which has a runtime of O(bn3mp). We provide an experimental comparison of MIPS and our algorithms.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
