<i>In Silico</i>Evolution of Gene Cooption in Pattern-Forming Gene Networks
Bibliographic record
Abstract
Gene recruitment or cooption occurs when a gene, which may be part of an existing gene regulatory network (GRN), comes under the control of a new regulatory system. Such re-arrangement of pre-existing networks is likely more common for increasing genomic complexity than the creation of new genes. Using evolutionary computations (EC), we investigate how cooption affects the evolvability, outgrowth and robustness of GRNs. We use a data-driven model of insect segmentation, for the fruit fly Drosophila, and evaluate fitness by robustness to maternal variability-a major constraint in biological development. We compare two mechanisms of gene cooption: a simpler one with gene Introduction and Withdrawal operators; and one in which GRN elements can be altered by transposon infection. Starting from a minimal 2-gene network, insufficient for fitting the Drosophila gene expression patterns, we find a general trend of coopting available genes into the GRN, in order to better fit the data. With the transposon mechanism, we find co-evolutionary oscillations between genes and their transposons. These oscillations may offer a new technique in EC for overcoming premature convergence. Finally, we comment on how a differential equations (in contrast to Boolean) approach is necessary for addressing realistic continuous variation in biochemical parameters.
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.001 | 0.003 |
| 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.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 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".