On the primer selection problem in polymerase chain reaction experiments

DOI10.1016/S0166-218X(96)00066-2zbMath0868.92012MaRDI QIDQ5961627

Tongtong Zhang, William R. Pearson, Gabriel Robins, Dallas E. Wrege

Publication date: 25 February 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

branch-and-bound algorithmapproximationDNA sequencesminimizing the number of primerspolymerase chain reaction experiments

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Complexity and performance of numerical algorithms (65Y20) Computational methods for problems pertaining to biology (92-08)

Related Items (3)

Mathematical programming in computational biology: an annotated bibliography ⋮ EFFICIENT ALGORITHMS FOR DEGENERATE PRIMER SEARCH ⋮ Minimal approximate hitting sets and rule templates

Cites Work

• Unnamed Item
• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• A Greedy Heuristic for the Set-Covering Problem
• A linear-time approximation algorithm for the weighted vertex cover problem
• On the hardness of approximating minimization problems

This page was built for publication: On the primer selection problem in polymerase chain reaction experiments