The Robustness of a Signaling Complex to Domain Rearrangements Facilitates Network Evolution
Bibliographic record
Abstract
The rearrangement of protein domains is known to have key roles in the evolution of signaling networks and, consequently, is a major tool used to synthetically rewire networks. However, natural mutational events leading to the creation of proteins with novel domain combinations, such as in frame fusions followed by domain loss, retrotranspositions, or translocations, to name a few, often simultaneously replace pre-existing genes. Thus, while proteins with new domain combinations may establish novel network connections, it is not clear how the concomitant deletions are tolerated. We investigated the mechanisms that enable signaling networks to tolerate domain rearrangement-mediated gene replacements. Using as a model system the yeast mitogen activated protein kinase (MAPK)-mediated mating pathway, we analyzed 92 domain-rearrangement events affecting 11 genes. Our results indicate that, while domain rearrangement events that result in the loss of catalytic activities within the signaling complex are not tolerated, domain rearrangements can drastically alter protein interactions without impairing function. This suggests that signaling complexes can maintain function even when some components are recruited to alternative sites within the complex. Furthermore, we also found that the ability of the complex to tolerate changes in interaction partners does not depend on long disordered linkers that often connect domains. Taken together, our results suggest that some signaling complexes are dynamic ensembles with loose spatial constraints that could be easily re-shaped by evolution and, therefore, are ideal targets for cellular engineering.
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".