Massive programmed translational jumping in mitochondria
Bibliographic record
Abstract
Programmed translational bypassing is a process whereby ribosomes "ignore" a substantial interval of mRNA sequence. Although discovered 25 y ago, the only experimentally confirmed example of this puzzling phenomenon is expression of the bacteriophage T4 gene 60. Bypassing requires translational blockage at a "takeoff codon" immediately upstream of a stop codon followed by a hairpin, which causes peptidyl-tRNA dissociation and reassociation with a matching "landing triplet" 50 nt downstream, where translation resumes. Here, we report 81 translational bypassing elements (byps) in mitochondria of the yeast Magnusiomyces capitatus and demonstrate in three cases, by transcript analysis and proteomics, that byps are retained in mitochondrial mRNAs but not translated. Although mitochondrial byps resemble the bypass sequence in the T4 gene 60, they utilize unused codons instead of stops for translational blockage and have relaxed matching rules for takeoff/landing sites. We detected byp-like sequences also in mtDNAs of several Saccharomycetales, indicating that byps are mobile genetic elements. These byp-like sequences lack bypassing activity and are tolerated when inserted in-frame in variable protein regions. We hypothesize that byp-like elements have the potential to contribute to evolutionary diversification of proteins by adding new domains that allow exploration of new structures and functions.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| 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 source (direct Gemma or distilled Codex), 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".