 Research article
 Open Access
 Published:
Designing multiple degenerate primers via consecutive pairwise alignments
BMC Bioinformatics volume 9, Article number: 55 (2008)
Abstract
Background
Different algorithms have been proposed to solve various versions of degenerate primer design problem. For one of the most general cases, multiple degenerate primer design problem, very few algorithms exist, none of them satisfying the criterion of designing low number of primers that cover high number of sequences. Besides, the present algorithms require high computation capacity and running time.
Results
PAMPS, the method presented in this work, usually results in a 30% reduction in the number of degenerate primers required to cover all sequences, compared to the previous algorithms. In addition, PAMPS runs up to 3500 times faster.
Conclusion
Due to small running time, using PAMPS allows designing degenerate primers for huge numbers of sequences. In addition, it results in fewer primers which reduces the synthesis costs and improves the amplification sensitivity.
Background
Polymerase Chain Reaction, or PCR [1], is a ubiquitous technique which amplifies a specific region of DNA, so that enough copies of that region is available to be adequately tested, sequenced or manipulated in other fashions. In order to use PCR, one must know the exact sequences which lie on either side of the DNA region of interest. These sequences are used to design two synthetic DNA oligonucleotides, or primers, one complementary to each strand of the DNA doublehelix and lying on opposite sides of the target region. The primers are typically 20–30 nucleotides long.
Assuming ∑ = {T, C, A, G} is the DNA alphabet [2], a sequence (e.g. a primer) can be shown as S = x_{1}x_{2}...x_{ l }, where x_{ i }⊆ ∑, x_{ i }≠ Ø and l is the length of S. A sequence is called degenerate if some of its positions have several possible bases [3]. For example, in the primer P* = {G}{G}{C,G}{A}{T,C,G}{A} the third position is C or G and the fifth is C, T or G. The IUPAC illustration of P* will be GGSABA (Figure 1). The degeneracy of a sequence is the number of unique sequence combinations it contains, which can be calculated as d(S) = Π^{l}_{i=1}x_{ i }. For example, d(P*) = 1 × 1 × 2 × 1 × 3 × 1 = 6. Degenerate primers are useful for amplifying several related genomic or cDNA sequences, and have been exploited in various applications such as amplifying DNA sequences of homologous genes or genes from a particular protein family and analysis of species diversity [4–6].
Traditionally, degenerate primers were designed manually by examining multiple alignments of the target sequences. However, several programs are now available for designing degenerate primers for aligned sequences. CODEHOP [7] and DePiCt [8] are programs for designing degenerate primers for aligned protein sequences in order to identify new members of protein families. For each given multiple sequence alignment, CODEHOP constructs a pair of primers. Each primer consists of a degenerate 3' core region, typically with degeneracy of at most 128, and a 5' consensus sequence that stabilizes annealing. It works well for small sets of proteins, taking into account the codon usage of the target genome as well as the desired annealing temperature. However, it is inappropriate for constructing primers with high degeneracy on large sets of long genomic sequences. DePiCt clusters the sequences using a simple similarity score and then designs a pair of primers for each cluster by translating conserved blocks of amino acids into nucleotides.
In order to obtain primers that cover a large number of known genes and thus have a good chance to detect new related ones, one should obviously use highly degenerate primers (the primer P = p_{1}p_{2}...p_{ l }covers the sequence S if there is a substring F of length l in S where for each character f_{ i }in F, f_{ i }⊆ p_{ i }). On the other hand, in order to reduce the probability of amplifying unrelated sequences, the degeneracy must be bounded. This contradictory nature of the degenerate primer design (DPD) problem has led to definition of several variants of this problem, all of which are NPcomplete:

1.
Maximum Coverage Degenerate Primer Design (MCDPD) tries to find a primer of length l and degeneracy at most d_{ max }that covers a maximum number of strings (sequences) of a given input set, each of length l. HYDEN [9], an algorithm based on a heuristic approach, basically addresses this variant of DPD problem and was first used to design degenerate primers for a set of genomic sequences in order to find new human olfactory receptor genes [9, 10].

2.
Minimum Degeneracy Degenerate Primer Design (MDDPD) addresses the problem of finding a primer of length l and minimum degeneracy that covers all the input strings, each of which having a length equal to or greater than l.

3.
Minimum Primers Degenerate Primer Design (MPDPD) is applied when a set of strings of length l is given, and finds a minimum number of primers of length l and degeneracy at most d_{ max }, so that each input string is covered by at least one primer.
MPDPD has the constraint that all input sequences are of the same length as the primers, which is not the case for most real situations. Removing this constraint, i.e. allowing the strings to have arbitrary lengths, results in a more general problem, Multiple Degenerate Primer Design (MDPD) [2]. MDPD is to find a minimum number of primers of length at least l_{ min }and degeneracy at most d_{ max }, given a set of n strings of various lengths (equal to or greater than l_{ min }), so that each input string is covered by at least one primer. A currently available algorithm for designing multiple degenerate primers, called PTMIPS [2], has been developed in the context of SNP genotyping. It uses an iterative beamsearch technique to construct progressively a set of primers until all sequences are covered.
In this work, we introduce a new algorithm for solving MDPD problems which consecutively uses an ad hoc p airwise a lignment for m ultiple p rimer s election – hence called PAMPS. We will show that PAMPS performs better than previous algorithms on different sets of input strings, i.e. results in smaller number of primers in a considerably less computation time.
Results and Discussion
To compare the performance of PAMPS with PTMIPS (Souvenir et al., 2003), different sets of random sequences were generated. Each set contained 20–100 sequences with similar length, but the lengths of sequences varied among different sets; sequences were of lengths 15–50 nucleotides. For each number of sequences and each sequence length three random sets were generated and the results were averaged over each triplet. PTMIPS asks the user for "beam size" as well as "pairwise fragment size" (for more discussion, see [2]). As changing the values of these parameters did not improve the results of PTMIPS significantly (Figure 2), we used the default values of PTMIPS, 10 and 6, for beam size and pairwise fragment size, respectively.
Both PAMPS and PTMIPS were used to solve MDPD problem for each of the above mentioned random sets given l_{ min }= 15 and d_{ max }= 10^{4}. Almost always PAMPS resulted in smaller primer sets. Only in few cases both PAMPS and PTMIPS produced primer sets with equal sizes. To compare PAMPS and PTMIPS quantitatively, we defined efficiency of PAMPS as
where m_{ MIPS }and m_{ PAMPS }represent the number of primers designed by PTMIPS and PAMPS, respectively. Figure 3 illustrates the values of f_{ PAMPS }for different numbers of sequences and different sequence lengths. Obviously PAMPS outperforms PTMIPS, especially when smaller sets of sequences or long sequences are used. In most situations, PAMPS decreases the number of final primers by 30%–35%. PAMPS outperforms PTMIPS for a wide range of primer sizes and maximum degeneracy values (Figure 4).
Comparing the run time of PAMPS and PTMIPS shows that PAMPS is astonishingly faster than PTMIPS (both software were run on a 2.4 GHz Intel^{®} CPU): solving MDPD problem for 100 input sequences of length 50 nucleotides is about 3380 times faster using PAMPS compared to PTMIPS (Figure 5). This allows PAMPS to be used to design highly degenerate primers for thousands of input sequences each hundreds of nucleotides long. Hence, even though the number of designed primers using PAMPS and PTMIPS may converge as the number of input sequences increases, considering computation time strongly encourages using PAMPS; for an input set of 10^{4} random sequences of length 2000, PAMPS needs an average time of 228 seconds to complete the computations on a 2.0 GHz Intel^{®} Core™ 2 CPU. We should mention that PTMIPS did not yield in any results after three days of running the same job as PAMPS. Based on previous comparisons of PAMPS and PTMIPS, we can estimate that for PTMIPS it takes more than nine days to finish a job like this.
PTMIPS [2] is previously compared with HYDEN [9]. Though HYDEN is basically designed to solve MCDPD problems, it can be used iteratively to approximate MDPD problems, i.e. once a primer of length l_{ min }and degeneracy at most d_{ max }is found that covers the maximum number of input sequences, the sequences which are covered by this primer are subtracted from input set and HYDEN is run again on the remaining sequences. By repeating this procedure, eventually a set of primers is obtained which covers all sequences. Since it has been shown that PTMIPS outperforms HYDEN [2] and as PAMPS outperforms PTMIPS, we avoided the direct comparison of PAMPS and HYDEN.
The output of PAMPS is a list of primers, most of which are longer than l_{ min }(Figure 6). Therefore, any subsequences of length l_{ min }from each output can be selected to be used for PCR amplification. If the longest possible PCR product is desired, then the very upstream subsequence should be used. However, for most PCR reactions it is important to have primers with similar annealing temperatures if a mixture of primers is used. Since different combinations of primers can be chosen, it is possible to select the primers that have similar annealing temperatures. PAMPS is accompanied by a simple iterative algorithm provided in a separate software that chooses the best combination of primers in order to achieve the minimum variance among primer annealing temperatures. Primer annealing temperatures are estimated as [11].
Conclusion
In this work we presented a new algorithm, called PAMPS, for solving MDPD problems. PAMPS exploits an altered pairwise alignment to select the subsequences which may be merged into degenerate primers. PAMPS was shown to run significantly faster than a previously developed software, PTMIPS [2] and also gives better results (i.e. smaller sets of primers), reducing the synthesis costs of primers. Besides, when the number of mixed primers that are used in a PCR reaction are decreased, the concentration of the reacting primer increases, which usually improves the sensitivity of amplification. PAMPS, in contrast to previous algorithms, does not restrict the output to the exact primer length that was given; instead, it may result in primers longer than the requested length which allows selecting an appropriate primer in terms of annealing temperature. PAMPS can be used to design degenerate primers for amplification of genes with uncertain sequences, such as new members of gene families or libraries of antibody variable fragments. An implementation of PAMPS is provided in the Additional file 1.
Methods
Merging two aligned sequences
Assume that the alignment of two sequences is given. Merging two nongapped aligned sequences S_{1} = x_{1}x_{2}...x_{ l }and S_{2} = y_{1}y_{2}...y_{ l }results in S_{1,2} = (x_{1} ∪ y_{1})(x_{2} ∪ y_{2})...(x_{ l }∪ y_{ l }) (Figure 7). Obviously, the regions of each sequence that are located in a gap are of no value in designing a degenerate primer that can cover both sequences. Therefore, these regions should be removed and the two regions surrounding each gap should be joined, at a point that is referred to as a "split point" through this article. Obviously, a degenerate primer that covers both sequences is located between two split points.
After reducing an alignment into a nongapped, split, degenerate sequence, the regions that in no way can participate in the ultimate degenerate primer should be removed. These regions consist of those having degeneracy larger than d_{ max }and those having lengths smaller than l_{ min }. To achieve this goal, we only retain those nucleotides that are located within at least one window with length l_{ min }and degeneracy at most d_{ max }. Obviously, this window cannot have a split point within. If no such a window could be found for a nucleotide, that nucleotide should be removed. This results in the removal of all nucleotides between two split points that are closer than l_{ min }. The remaining regions are joined together with a new split point (Figure 8).
Alignment
The alignment algorithm that is used by PAMPS is very similar to the conventional global alignment [12]. However, the scoring methods differ in some details. Since the purpose is to achieve an alignment that results in a merged sequence with low degeneracy, we defined the score of each match/mismatch asM(x, y) = 2  log_{2} x ∪ y.
in which x, y ⊆ ∑. The two sequences that are being aligned may contain some split points as they may themselves have been resulted from merging other sequences. In this case, passing over a split point has the same penalty as gap opening (see Figure 9). In this work, we set the penalty of gap opening to 10.0 and gap extension to 0.0, since for our purpose it is of no importance how long a gap is. Merging two split sequences causes all split points to be copied into the relevant positions in the merged sequence. After two aligned sequences are merged and refined (Figure 8), the alignment score is recalculated, since some of the portions that are scored in the original alignment may be removed in the refined sequence.
Designing degenerate primers
In order to design degenerate primers, pairs of sequences should be aligned and merged consecutively until no more sequences could be merged (i.e. merging any more pairs of sequences results in primers either with lengths less than l_{ min }or with degeneracy more than d_{ max }). However, there are different combinations in which sequences can be merged, each of which may result in a different set of primers. The optimum set is the one that contains the least number of primers. PAMPS uses a procedure similar to MIPS [2] to search for the optimum set of primers:
Assume that P = {P_{1}, P_{2}, ..., P_{ m }} covers the set S = {S_{1}, S_{2}, ..., S_{ n }} (P covers S if for each S_{ j }∈ S, 1 ≤ j ≤ n there is a P_{ i }∈ P, 1 ≤ i ≤ m which covers S_{ j }). For the S_{n+1}to be covered by P, m+1 "actions" are possible: merging S_{n+1}with P_{ i }(1 ≤ i ≤ m), or adding a new primer (P_{m+1}, which is the same as S_{n+1}) to P. Thus, PAMPS starts with P = {P_{1}}, P_{1} = S_{1}, and either merges S_{2} with P_{1} or adds it to P as P_{2}. P is expanded until it covers all sequences. If in any step one of the requirements of MDPD is not fulfilled, i.e. the length of a primer becomes less that l_{ min }or the degeneracy of a primer exceeds d_{ max }, PAMPS backtracks to a previous P and continues with another "action" (Figure 10). PAMPS searches for all P's each of which covering all sequences, and chooses the one with the minimum P (i.e. chooses the P that covers all sequences with the minimum possible number of primers); however, the minimum P is guaranteed only if the following conditions are met; (1) no heuristic approach is employed; (2) no gap is allowed in alignment of sequences, i.e. penalty of gap opening is 8; (3) length of each sequence is equal to required primer length which turns the problem into MPDPD. Finding the minimum P is simply a result of searching all combination of actions, which is obviously not possible for large sets of input sequences; hence the need for a heuristic approach is emerging.
PAMPS uses a similar heuristic approach as MIPS [2] to reduce the search space. Assume P_{1} is a previously found set of primers that contains m primers and covers n sequences, and P_{2} is a newly found set that also contains m primers and covers n sequences. P_{2} is only expanded if the sum of scores of its primers (see section Alignment) exceeds that of P_{1} (Figure 10).
References
 1.
Mullis K, Faloona F, Scharf S, Saiki R, Horn G, Erlich H: Specific enzymatic amplification of DNA in vitro : The polymerase chain reaction. Cold Spring Harbor Symp Quant Biol 1986, 51: 263–273.
 2.
Souvenir R, Buhler J, Stormo G, Zhang W: Selecting degenerate multiplex PCR primers. Proceedings of the 3rd Workshop on Algorithms in Bioinformatics (WABI 2003) 2003, 512–526.
 3.
Kwok S, Chang S, Sninsky J, Wang A: A guide to the design and use of mismatched and degenerate primers. PCR Methods Appl 1994, 3: S39S47.
 4.
Fuchs T, Malecova B, Linhart C, Sharan R, Khen M, Herwig R, Shmulevich D, Elkon R, Steinfath M, O'Brien JK, Radelof U, Lehrach H, Lancet D, Shamir R: DEFOG: A Practical Scheme for Deciphering Families of Genes. Genomics 2002, 80(3):1–8. 10.1006/geno.2002.6830
 5.
Jarman SN: Amplicon: software for designing PCR primers on aligned DNA sequences. Bioinformatics 2007, 20(10):1644–1645. 10.1093/bioinformatics/bth121
 6.
Jarman SN, Deagle BE, Gales NJ: Groupspecific PCR for DNAbased analysis of species diversity and identity in dietary samples. Mol Ecol 2003, 13: 1313–1322. 10.1111/j.1365294X.2004.02109.x
 7.
Rose T, Schultz E, Henikoff J, Pietrokovski S, McCallum C, Henikoff S: Consensusdegenerate hybrid oligonucleotide primers for amplification of distantly related sequences. Nucleic Acids Res 1998, 26: 1628–1635. 10.1093/nar/26.7.1628
 8.
Wei X, Kuhn D, Narasimhan G: Degenerate primer design via clustering. Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference (CSB 2003) 2003, 75–83.
 9.
Linhart C, Shamir R: The degenerate primer design problem. Bioinformatics 2002, 18: S172S180.
 10.
Linhart C, Shamir R: The Degenerate Primer Design Problem: Theory and Applications. J Comput Biol 2005, 12: 431–456. 10.1089/cmb.2005.12.431
 11.
Breslauer KJ, Frank R, Blocker H, Marky LA: Predicting DNA duplex stability from the base sequence. Proc Natl Acad Sci USA 1986, 83: 3746–3750. 10.1073/pnas.83.11.3746
 12.
Needleman SB, Wunsch CD: A general method applicable to the search for similarities in the amino acid sequence of two proteins. J Mol Biol 1970, 48: 443–453. 10.1016/00222836(70)900574
 13.
CornishBowden A: IUPACIUB symbols for nucleotide nomenclature. Nucleic Acids Res 1985, 13: 3021–3030. 10.1093/nar/13.9.3021
Acknowledgements
Authors are grateful to Manely Rashedan for her everlasting supports. This project is granted by Avesina Research Institute, Tehran. HSN and NT are also supported by University of Tehran.
Author information
Additional information
Authors' contributions
HSN developed the algorithm, performed the analysis and participated in preparing the manuscript. NT prepared the background and discussion and drafted the manuscript. MC designed and coordinated the study and contributed in preparing the manuscript. All authors read and approved the final manuscript.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
About this article
Cite this article
Najafabadi, H.S., Torabi, N. & Chamankhah, M. Designing multiple degenerate primers via consecutive pairwise alignments. BMC Bioinformatics 9, 55 (2008). https://doi.org/10.1186/14712105955
Received:
Accepted:
Published:
Keywords
 Input Sequence
 Degenerate Primer
 Input String
 Split Point
 Olfactory Receptor Gene