G-POT

G-POT optimizes primer set selection for multiplex polymerase chain reaction (MP-PCR) assays by minimizing the number of primers while ensuring paired primers within a user-defined distance L base pairs for efficient amplification of multiple genomic loci.


Key Features:

  • Primer Pairing: Requires each locus to be amplified by a pair of primers located within a user-defined distance L base pairs.
  • Efficiency Optimization: Minimizes the total number of primers while enforcing length constraints between primer binding sites to enhance MP-PCR cost-effectiveness.
  • Greedy Algorithm: Implements an improved greedy algorithm for primer selection to generate compact primer sets with computational efficiency.
  • Comparative Analysis: Performs experimental comparisons against other published heuristics using synthetic datasets and real genomic databases.

Scientific Applications:

  • MP-PCR primer design: Optimizing primer sets for multiplex polymerase chain reaction assays to amplify multiple genomic loci.
  • High-throughput genomics: Streamlining primer selection in high-throughput genomics assays that require amplification of large numbers of loci.
  • Cost-effective large-scale studies: Reducing primer count to lower cost and complexity in large-scale genomic studies.

Methodology:

Uses an improved greedy algorithm to select primer pairs under the constraint that each locus is covered by a primer pair within distance L base pairs and minimizes the total number of primers; performance is evaluated by comparative experiments on synthetic datasets and real genomic databases.

Topics

Details

Tool Type:
command-line tool
Operating Systems:
Linux
Added:
12/18/2017
Last Updated:
12/10/2018

Operations

Publications

Konwar KM, Mǎndoiu II, Russell AC, Shvartsman AA. Algorithms for Multiplex PCR Primer Set Selection with Amplification Length Constraints. Bioinformatics Algorithms. 2007. doi:10.1002/9780470253441.ch11.

Documentation

Links