Principles of <i>in vitro</i> selection of ribozymes from random sequence libraries
Bibliographic record
Abstract
selection methods are used to identify catalytic RNAs from pools of random sequences. We discuss the central concepts using experimental data and computational models. Experiments proceed in multiple rounds, each with a reaction step and a step in which reacted sequences are recovered. Sequences are enriched each round by a factor depending on combined reaction and recovery probability. In the first round, there are few functional sequences, and it is necessary to minimize the probability of losing these. In later rounds, the loss probability is negligible, and the procedure can be optimized to maximize the enrichment factor. Clusters of related sequences emerge which descend from separate sequences in the initial pool. The fitness of an RNA depends on how well it matches a structure with specified sequence and base-pair constraints. Sequences that exactly match the constraints may be rare, but sequences a few mutations away are much more common; hence it is likely that clusters descend from suboptimal sequences. There is a high probability that beneficial mutations arise during the experiment. This explains the experimental observation that there is little correlation between cluster frequencies and fitnesses, whereas correlation between enrichment factors and fitnesses is strong.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".