Computational Modeling of Signaling Networks for Eukaryotic Chemosensing
Bibliographic record
Abstract
The task of developing and simulating computational models of signaling networks for eukaryotic chemosensing confronts the modeler with several challenges: (1) The stimuli that initiate the cellular responses one wishes to study are provided by extracellular concentration gradients. This means that the computational model must have a spatially resolved representation of extracellular molecular concentrations. (2) The intracellular responses consist of the generation of intracellular accumulations and/or translocations of signaling molecules, requiring spatially resolved computational representations of the simulated cells. (3) The signaling networks responsible for eukaryotic chemosensing comprise a multitude of components acting as receptors, adaptors, (lipid- and protein-) kinases (including GTPases), (lipid- and protein-) phosphatases, and molecule types used by others for membrane attachment. Models of such signaling networks may become quite complicated, unless one wishes to rely on abstract functional modules with certain input-output characteristics as modeling "shortcuts" replacing subnetworks of biological signaling molecules. In this chapter, we describe how modelers can use a modeling tool ("simmune") developed to facilitate the design and simulation of detailed computational models of signaling pathways (for eukaryotic chemosensing here), thereby avoiding the technical difficulties typically associated with building and simulating such quantitative models.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".