EFFICIENT ALGORITHMS FOR DEGENERATE PRIMER SEARCH

DOI10.1142/S0129054107005042MaRDI QIDQ3503104zbMATH OpenOpenAlexFDO

Authors Sudha Balla, Ion Măndoiu, Sanguthevar Rajasekaran

Publication date 20 May 2008

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054107005042

zbMATH Keywords

Degenerate primer designMP-PCR primer selectionprimers for multiplex PCR

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20)

Recommendations

• On the primer selection problem in polymerase chain reaction experiments
• The multiple sequence sets: Problem and heuristic algorithms
• A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching
• IDPM: an improved degenerate pattern matching algorithm for biological sequences
• Deterministic polynomial-time algorithms for designing short DNA words

Cites work

• On the primer selection problem in polymerase chain reaction experiments

Cited in

(1)

• On the primer selection problem in polymerase chain reaction experiments

This page was built for publication: EFFICIENT ALGORITHMS FOR DEGENERATE PRIMER SEARCH

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503104)