Implementing an OR–NOT (ORN) logic gate with components of the SOS regulatory network of <i>Escherichia coli</i>
Bibliographic record
Abstract
Whether biological or electronic, man-engineered computation is based on logic circuits assembled with binary gates that are interconnected to perform Boolean operations. We report here the rewiring of the SOS system of Escherichia in a fashion that makes the output of both the recA and lexA promoters to faithfully follow the pattern of a binary composite OR-NOT gate (ORN) in which the inputs are DNA damage (e.g. nalidixic acid addition) and IPTG as an exogenous signal. Unlike other non-natural gates whose implementation requires changes in genes and promoters of the genome of the host cells, this ORN was brought about by the sole addition of wild-type bacteria with a plasmid encoding a module for LacI(q)-dependent expression of lexA. Specifically, we demonstrate that the interplay between native, chromosomally-encoded components of the SOS system and the extra parts engineered in such a plasmid made the desired performance to happen without any modification of the core DNA-damage response network. It is thus possible to artificially interface autonomous cell networks with a predetermined logic by means of Boolean gates built with regulatory elements already functioning in the recipient organism.
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.001 | 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".