On the primer selection problem in polymerase chain reaction experiments (Q5961627): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A linear-time approximation algorithm for the weighted vertex cover problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3619797 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for combinatorial problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the ratio of optimal integral and fractional covers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the hardness of approximating minimization problems / rank | |||
Normal rank | |||
Latest revision as of 09:51, 27 May 2024
scientific article; zbMATH DE number 981924
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the primer selection problem in polymerase chain reaction experiments |
scientific article; zbMATH DE number 981924 |
Statements
On the primer selection problem in polymerase chain reaction experiments (English)
0 references
25 February 1997
0 references
polymerase chain reaction experiments
0 references
minimizing the number of primers
0 references
DNA sequences
0 references
branch-and-bound algorithm
0 references
approximation
0 references
