Loading…
Multiplexing Short Primers for Viral Family PCR
We describe a Multiplex Primer Prediction (MPP) algorithm to build multiplex compatible primer sets for large, diverse, and unalignable sets of target sequences. The MPP algorithm is scalable to larger target sets than other available software, and it does not require a multiple sequence alignment....
Saved in:
Published in: | Nucleic acids research 2008-06 |
---|---|
Main Authors: | , , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | We describe a Multiplex Primer Prediction (MPP) algorithm to build multiplex compatible primer sets for large, diverse, and unalignable sets of target sequences. The MPP algorithm is scalable to larger target sets than other available software, and it does not require a multiple sequence alignment. We applied it to questions in viral detection, and demonstrated that there are no universally conserved priming sequences among viruses and that it could require an unfeasibly large number of primers ({approx}3700 18-mers or {approx}2000 10-mers) to generate amplicons from all sequenced viruses. We then designed primer sets separately for each viral family, and for several diverse species such as foot-and-mouth disease virus, hemagglutinin and neuraminidase segments of influenza A virus, Norwalk virus, and HIV-1. |
---|---|
ISSN: | 0305-1048 1362-4962 |