design_degenerate_primers
Design degenerate primers from a multiple-sequence ALIGNMENT - the 'amplify every homologue in this family' question, which a single-template designer cannot answer because it only ever sees one sequence.
Tool call template
This tool declares no required parameters. Add optional parameters from the input schema as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {},
"name": "design_degenerate_primers"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| seed | No | seed for WRM's draw, so a run is REPRODUCIBLE. Upstream is unseeded, so the same alignment can give two answers; a design you cannot reproduce is not one you can order from. Only applies when algorithm is wrm. Advanced. | |
| skip | No | bases excluded at each end of every sequence (`-skip`). In nt. Advanced. | |
| limit | No | how many pairs to return, best coverage first. Advanced. | |
| _files | No | The project: record references shaped like _subject. Their records become library documents a tool names in sequences/parts/document; a trace or alignment is found by file name. | |
| length | No | oligomer length (DegePrime `-l`). In nt. | |
| _subject | No | The record to act on: exactly one of sequence, accession (+source), sample (an id from list_samples) or file ({name, text} or {name, base64}); record_index picks one record of several. | |
| algorithm | No | which search picks each window's oligo. `wrm` is DegePrime's own default and is randomised (hence `seed`); `exhaustive` is an exact branch-and-bound that GRADES the heuristics rather than letting them grade each other, and REFUSES a window too large to solve rather than guessing - the problem is NP-hard. | wrm |
| alignment | No | the ALIGNED rows to scan, each `{ name, sequence }` with gaps preserved - wire an upstream `align_sequences` rows output here. Gaps carry information the scan reads, so an unaligned set is not a substitute. | |
| min_depth | No | fewest gapless sequences a window needs before it is reported at all (`-depth`). Advanced. | |
| iterations | No | WRM restarts (`-iter`). Only applies when algorithm is wrm. Advanced. | |
| max_product | No | longest product, in TRIMMED alignment columns. In col. | |
| min_product | No | shortest product, in TRIMMED alignment columns. In col. | |
| trim_cutoff | No | columns occupied by less than this fraction of sequences are dropped before scanning. Trimming renumbers the alignment, which is why `keptColumns` comes back with the result. Advanced. | |
| max_degeneracy | No | degeneracy ceiling (`-d`) - how many distinct oligos the IUPAC code is allowed to stand for. Coerced DOWN when no combination of positions can multiply to it, and the run says so. | |
| alignment_fasta | No | an aligned FASTA to scan, when there is no upstream alignment to wire. Sequences must already BE aligned - equal length, gaps as `-`. | |
| exhaustive_mer_limit | No | largest number of distinct mers `exhaustive` will attempt before refusing a window. Only applies when algorithm is exhaustive. Advanced. | |
| min_fraction_matching | No | a window must bind at least this fraction of the spanning sequences to be a candidate - the coverage floor, and the number that decides whether 'every homologue' is true. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| pairs | Yes | the primer pairs, best coverage first: both oligos in IUPAC letters, their degeneracy, the fraction of the family each binds, and the product span in trimmed columns | |
| forward | Yes | the best pair's forward oligo, IUPAC. Empty when no pair satisfied the constraints | |
| reverse | Yes | the best pair's reverse oligo AS ORDERED (reverse-complemented). Empty when no pair satisfied the constraints | |
| windows | Yes | every scanned window with its degeneracy, entropy and coverage - the scan behind the pairs | |
| pairCount | Yes | how many pairs were found | |
| keptColumns | Yes | which columns of the ORIGINAL alignment survived trimming - trimmed column 40 is not alignment column 40, and this is the map back | |
| degeneracyCoerced | Yes | true when the ceiling was lowered, so a run never silently answers a different question than it was asked | |
| maxDegeneracyUsed | Yes | the degeneracy ceiling actually applied - LOWER than asked when no combination of IUPAC positions can multiply to the request |