How Broken DNA Finds Its Template for Repair: A Computational Approach
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Homologous recombination (HR) is the process by which a double-strand break in DNA is repaired using an identical donor template. Despite rapid progress in identifying the functions of the proteins that mediate HR, little is known about how broken DNA finds its homologous template. This process, coined homology search, has been difficult to monitor experimentally. Therefore, we present here a computational approach to model the effect of subnuclear positioning and chromatin dynamics on homology search. We found that, in our model, homology search occurs more efficiently if both the cut site and its template are at the nuclear periphery, whereas restricting the movement of the template or the break alone to the periphery markedly increases the time of the search. Immobilization of either component at any position slows down the search. Based on these results, we propose a new model for homology search, the facilitated random search model, which predicts that the search is random, but that nuclear organization and dynamics strongly influence its speed and efficiency.
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.
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 it