Algorithmic Reconstruction of GBM Network Complexity
Bibliographic record
Abstract
SUMMARY Glioblastoma (GBM) is a complex disease that is difficult to treat. Establishing the complex genetic interactions regulating cell fate decisions in GBM can help to shed light on disease aggressivity and improved treatments. Networks and data science offer alternative approaches to classical bioinformatics pipelines to study gene expression patterns from single-cell datasets, helping to distinguish genes associated with control of differentiation and thus aggressivity. Here, we applied a host of data theoretic techniques, including clustering algorithms, Waddington landscape reconstruction, trajectory inference algorithms, and network approaches, to compare gene expression patterns between pediatric and adult GBM, and those of adult glioma-derived stem cells (GSCs) to identify the key molecular regulators of the complex networks driving GBM/GSC and predict their cell fate dynamics. Using these tools, we identified critical genes and transcription factors coordinating cell state transitions from stem-like to mature GBM phenotypes, including eight transcription factors (OLIG1/2, TAZ, GATA2, FOXG1, SOX6, SATB2, YY1) and four signaling genes (ATL3, MTSS1, EMP1, and TPT1) as clinically targetable novel putative function interactions differentiating pediatric and adult GBMs from adult GSCs. Our study provides strong evidence of the applicability of complex systems approaches for reverse-engineering gene networks from patient-derived single-cell datasets and inferring their complex dynamics, bolstering the search for new clinically relevant targets in GBM.
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.001 | 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.001 | 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".