Designing multiple degenerate primers via consecutive pairwise alignments


<p>Abstract</p> <p>Background</p> <p>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.</p> <p>Results</p> <p>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.</p> <p>Conclusion</p> <p>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.</p

Similar works

Full text


Directory of Open Access Journals

Provided original full text link
oai:doaj.org/article:416609c40ba44fc29cdb6b36dab8e29fLast time updated on 12/18/2014

This paper was published in Directory of Open Access Journals.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.