An Efficient Algorithm for Minimum Degeneracy Primer Selection

Selecting degenerate primers for multiplex polymerase chain reaction (MP-PCR) experiments, called the degenerate primer design problem (DPDP), is an important problem in computational molecular biology and has drawn the attention of numerous researchers in the recent past. Several variants of DPDP were formulated by Linhart and Shamir and proven to be NP-complete. A number of algorithms have been proposed for one such variant, namely, the maximum coverage degenerate primer design problem (MC-DPDP). In this paper, we consider another important variant called the minimum degeneracy degenerate primer design with errors problem (MD-DPDEP), propose an algorithm to design a degenerate primer of minimum degeneracy for a given set of DNA sequences and show experimental results of its performance on random and real biological datasets. Our algorithm combines methodologies in motif discovery and an iterative technique to design the primer

[1]  R. Karp,et al.  Efficient reconstruction of haplotype structure via perfect phylogeny. , 2002, Journal of bioinformatics and computational biology.

[2]  Sriram Ramabhadran,et al.  Finding subtle motifs by branching from sample strings , 2003, ECCB.

[3]  Doi,et al.  Greedy Algorithms for Finding a Small Set of Primers Satisfying Cover and Length Resolution Conditions in PCR Experiments. , 1997, Genome informatics. Workshop on Genome Informatics.

[4]  S. Kwok,et al.  A guide to the design and use of mismatched and degenerate primers. , 1994, PCR methods and applications.

[5]  Eleazar Eskin,et al.  Finding composite regulatory patterns in DNA sequences , 2002, ISMB.

[6]  Francis Y. L. Chin,et al.  Voting algorithms for discovering long motifs , 2005, APBC.

[7]  Sanguthevar Rajasekaran,et al.  Exact Algorithms for Planted Motif Problems , 2005, J. Comput. Biol..

[8]  Roded Sharan,et al.  DEFOG: a practical scheme for deciphering families of genes. , 2002, Genomics.

[9]  Doi,et al.  A Greedy Algorithm for Minimizing the Number of Primers in Multiple PCR Experiments. , 1999, Genome informatics. Workshop on Genome Informatics.

[10]  R A Gibbs,et al.  Deletion screening of the Duchenne muscular dystrophy locus via multiplex DNA amplification. , 1988, Nucleic acids research.

[11]  S. Henikoff,et al.  Consensus-degenerate hybrid oligonucleotide primers for amplification of distantly related sequences. , 1998, Nucleic acids research.

[12]  Jeremy Buhler,et al.  Finding motifs using random projections , 2001, RECOMB.

[13]  Weixiong Zhang,et al.  Selecting Degenerate Multiplex PCR Primers , 2003, WABI.

[14]  Ron Shamir,et al.  Theory and applications , 2004 .

[15]  Pavel A. Pevzner,et al.  Combinatorial Approaches to Finding Subtle Signals in DNA Sequences , 2000, ISMB.

[16]  Ron Shamir,et al.  The Degenerate Primer Design Problem , 2002, ISMB.

[17]  Xintao Wei,et al.  Degenerate primer design via clustering , 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.

[18]  William R. Pearson,et al.  On the Primer Selection Problem in Polymerase Chain Reaction Experiments , 1996, Discret. Appl. Math..

[19]  Sanguthevar Rajasekaran,et al.  Efficient Algorithms for degenerate Primer Search , 2007, Int. J. Found. Comput. Sci..

[20]  Uri Keich,et al.  Finding motifs in the twilight zone , 2002, RECOMB '02.