Search arXiv⌕ Search

arXiv · 2610.40447

Learning developmental dynamics from lineage context

Abstract

A central goal of biology is to predict the dynamics of multicellular systems. Lineage context (the states of a cell's sisters, cousins, etc.) could inform these predictions, but how best to leverage it remains unclear. Here we introduce lineage inpainting, a generative modeling approach that uses lineage context with tree-structured transformers and stochastic interpolants to model cell state dynamics across lineage trees. Applied to a lineage-traced transcriptional atlas of mouse embryogenesis, it recovers dynamics not resolved by gene expression alone, including multiple transcriptional convergence events where distinct lineages are drawn to a common state. Despite being fit on unperturbed development, lineage inpainting can generate hypotheses about perturbation responses by simulating counterfactuals. These simulations agree in many cases with observed developmental phenotypes, including a single-cell measurement of the Tbx5 knockout response. Our results show that lineage information provides a rich source of context for learning multicellular dynamics.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gokul Gowri, Nic Fishman, William N. Colgan, Minming Wang, Yusuke Kijima, Sachin A. Kumar, Aleksandr Zimin, Luke W. Koblan, Marinka Zitnik, Zachary D. Smith, Stephen Bates, Philippe Rigollet, Jonathan S. Weissman. 2026-10-29. Learning developmental dynamics from lineage context. https://arxiv.org/abs/2610.40447

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

gpuGEM: GPU-based linear optimisation of genome-scale metabolic models

Summary: Genome-scale metabolic models increasingly challenge CPU linear-programming solvers in repeated optimisation. We present gpuGEM, an open-source Python library for GPU-based optimisation using NVIDIA cuOpt, with size-adaptive settings validated against HiGHS and Gurobi. Across ten models spanning four orders of magnitude, gpuGEM achieved 1.1x to 94x speed-ups over the faster HiGHS method (dual simplex or interior point), and outperformed Gurobi on three models (1.6x to 2.5x). In candidate-gene prioritisation, gpuGEM reduced end-to-end query time from 41 s to 21 s. Availability and Implementation: gpuGEM is released under the MIT licence at https://github.com/Digital-Metabolic-Twin-Centre/gpuGEM and on PyPI (pip install gpugem); release v0.1.3 is archived at https://zenodo.org/records/23422813. It requires an NVIDIA GPU of compute capability 7.0 or newer (Volta onward), Python 3.11 or later, CUDA 12 and cuOpt 26.6 or later. Contact: ronan.mt.fleming@gmail.com Supplementary information: Supplementary data are available as an ancillary file on arXiv.

q-bio.QM↗

The Verification Wall in Microbial Metabolomics

Computational methods now propose structures for gut microbial metabolites faster than any laboratory can confirm them. We argue that verification, not generation, is the binding constraint, and that better models will not relieve it. Confirming a structure to the field's own standard means having the molecule in hand. Automation can lower what that costs per compound, but the cost stays proportional to the number of structures and never amortizes across them. Two substitutes are on offer and neither removes that requirement. In-silico spectral prediction ranks candidates instead of confirming one, and the strongest current model puts the right structure first 33.5% of the time on a scaffold-split benchmark. Any assignment resting on spectral similarity is, by the field's own definition, made without a reference standard. Microcrystal diffraction does return a structure, but it needs the compound to crystallize out of a trace mixture, which is a different problem rather than an easier one. We sorted 10,645 computationally inferred metabolite structures by what verifying each would take. Between 5% and 37% have no verification route identified under our analysis. That spread reflects where the thresholds are set rather than a measured count of unverifiable compounds, and the inaccessible ones cluster among the most speculative entries. Those figures understate the problem, because the gut makes far more compounds than any database records. HMDB holds only what someone has already thought worth cataloguing, and structure generators are bounded by nothing at all. The claim is easy to disprove. Show a route that confirms structures as fast as they are proposed. Until someone does, two problems stay unsolved. Nobody knows how to spend a verification budget that will always be too small, or what a biologist may conclude from a structure that was never confirmed.

q-bio.QM↗

PCR-ALERA: A PCR-ELISA analogue but antibody-free DNA detection system

PCR-ALERA is a new concept for DNA detection that combines DNA amplification by polymerase chain reaction (PCR) with an activator-linked enzyme reactivation assay (ALERA). PCR-ALERA resembles the commercial, semi-quantitative PCR-ELISA assay that offers high sensitivity and high-throughput screening in microplates. PCR-ALERA overcomes a major drawback of PCR-ELISA since it does not require the time-consuming handling of expensive antibodies. In the first step of the assay, commercially available modified nucleotides were incorporated during PCR amplification of the target DNA. A selenocysteine containing peptide (the activator) was linked to the amplified DNA by click chemistry. This peptide has been optimized for the highly efficient activation of the latent protease papain by selenolate-triggered disulfide cleavage. The DNA-peptide hybrid was then immoblized in microplate wells and incubated with latent papain. The latter was readily activated and converted a fluorogenic substrate to a fluorescent product with high catalytic turnover. Overall assay time is about 4 hours including PCR.

q-bio.QM↗