Ontology highlight
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.
SUBMITTER: Najafabadi HS
PROVIDER: S-EPMC2253518 | biostudies-literature | 2008 Jan
REPOSITORIES: biostudies-literature
Najafabadi Hamed Shateri HS Torabi Noorossadat N Chamankhah Mahmood M
BMC bioinformatics 20080127
<h4>Background</h4>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.<h4>Results</h4>PAMPS, the method presented in this work, usually results in a 3 ...[more]