Research Radar — 2026-11-20

Generated 2026-11-20T05:57:44.290944+08:00 approved RSS sources Curated daily research digest; 20/20 primary RSS feeds and 8/8 PubMed-indexed journal feeds available. Indexing may lag publication; coverage is not exhaustive.

Methods & AI

Computational

4 selected
Computational #1 Read methods and benchmark it on known simulated deformations. Grid resolution limits retained detail; continuous, similarly spaced sections dominate validation. The final polyp reconstruction excludes sections beyond a tissue-loss discontinuity. Do not interpret a plausible 3D map as recovered missing anatomy.

Space-map: 3D single-cell atlas reconstruction from serial sections

Nature Methods Published 2026-11-19 Peer-reviewed primary research DOI: 10.1038/s41592-026-03310-8

Authors: Rongduo Han; Cihan Ruan; Bingqing Zhao; Yuqi Tan; Emma Monte; Bei Wei; Joanna Bi; Thomas V. Karathanos; Rozelle Laquindanum; Gregory W. Charville; Yiing Lin; Nam Ling; James M. Ford; Garry P. Nolan; Meng Wang; Chenchen Zhu; Michael P. Snyder

spatial omics 3D registration benchmarking

Summary: Space-map rasterizes cell centroids, combines SIFT/LoFTR matching with affine registration and LDDMM refinement, and reduces serial-section drift through multisection alignment. It demonstrates reconstructions in Xenium and CODEX data and benchmarks against existing registration approaches.

Why it matters: It makes atlas-scale coordinate registration practical without treating pairwise agreement as sufficient for global tissue geometry.

Why for Yiru: A directly useful comparator for FEAST 3D reconstruction and spatial-alignment stress tests, especially for separating coordinate recovery from expression generation.

Computational #2 Read the criteria sensitivity and sampling assumptions. Results condition on supplied clonal trees and location labels; time-point compatibility may require filtering. Enumeration limits and run time affect completeness in practice, and support across optimal solutions is not a calibrated posterior probability.

Characterizing the solution space of migration histories of metastatic cancers with MACH2

Nature Methods Published 2026-11-19 Peer-reviewed primary research DOI: 10.1038/s41592-026-03321-5

Authors: Mrinmoy S. Roddur; Vikram Ramavarapu; Abigail Bunkum; Ariana Huebner; Roman Mineyev; Nicholas McGranahan; Simone Zaccaria; Mohammed El-Kebir

lineage inference uncertainty cancer evolution

Summary: MACH2 enumerates optimal metastatic migration histories under an explicitly ordered set of parsimony criteria, including minimizing clones assigned to unobserved locations. Simulations and 145 cancers show how many alternative dissemination histories can fit the same data.

Why it matters: The main contribution is exposing non-identifiability instead of presenting one inferred migration tree as ground truth.

Why for Yiru: A transferable lesson for lineage and cell-interaction inference: report solution-space uncertainty separately from confidence in upstream measurements.

Computational #3 Inspect marker coverage and assignment confidence; novel states can be forced into existing labels. Journal metadata and earlier full text were reviewed.

MapMyCells: High-performance mapping of cell-by-gene data to reference brain taxonomies.

Cell Reports Methods (via PubMed) Published 2026-11-12 Peer-reviewed methods paper; full-method review used its earlier preprint DOI: 10.1016/j.crmeth.2026.101650

Authors: Scott F Daniel; Changkyu Lee; Tyler Mollenkopf; Matthew Lee; Joel Arbuckle; Elysha Fiabane; Mariano I Gabitto; Nelson Johansen; Inkar Kapen; Andrew W Kraft; Hsin-Yu Lai; Su Ying Li; Ryan McGinty; Jeremy A Miller; Skyler Welch-Moosman; Sven Otto; Lane Sawyer; Noah Shepard; Carol L Thompson; Andreas Tjärnberg; Jack Waters; Xingjian Zhen; Evan Macosko; Ed Lein; Lydia Ng; Hongkui Zeng; Shoaib Mufti; Zizhen Yao; Mike Hawrylycz

reference mapping spatial transcriptomics cell annotation benchmarking

Summary: MapMyCells maps cell-by-gene profiles to hierarchical brain references using marker-based correlations and bootstrap assignment scores.

Why it matters: The accessible primary preprint evaluates gene-panel sensitivity, external spatial and ATAC data, and resource requirements.

Why for Yiru: A transparent, lightweight annotation baseline for spatial datasets and atlas-transfer evaluation.

Computational #4 Prioritize independent-metadata validation and protocol effects; do not treat supervised separation or pseudoprogression as causal dynamics.

Reconstructing developmental and disease progression with sample-level embeddings.

Cell (via PubMed) Published 2026-11-09 Peer-reviewed research article DOI: 10.1016/j.cell.2026.10.018

Authors: Longda Jiang; Zhixin Cyrillus Tan; Isabella N Grabski; Yuhan Hao; Nathan Nakatsuka; Sourav Sarkar; Anagha Shenoy; Rahul Satija

single-cell sample embeddings benchmarking

Summary: scSLIDE combines cell-type and phenotype-aware embeddings with landmark density profiles to compare whole samples. Independent cohorts and withheld pathology measures support continuous heterogeneity beyond binary case-control labels.

Why it matters: Offers a sample-level baseline for cohort and perturbation comparisons, with explicit control of abundance versus expression effects.

Why for Yiru: Prioritize independent-metadata validation and protocol effects; do not treat supervised separation or pseudoprogression as causal dynamics.

Biomedical discoveries

Biomedicine

6 selected
Biomedicine #1 Use as a candidate resource; separate expression detection, cellular localization and causal immune function.

An integrative single-cell long noncoding RNA atlas reveals regulatory programs in the pan-cancer tumor microenvironment | Science Advances

AAAS: Science Advances: Table of Contents Published 2026-11-18 Peer-reviewed research article DOI: 10.1126/sciadv.aei2542

Authors: Not provided in feed

lncRNA tumor microenvironment single-cell atlas

Summary: IO-LncLand integrates immune-cell lncRNA expression across 18 cancer types with regulatory-network, clinical and existing perturbation evidence, providing candidates for follow-up rather than universal causal assignments.

Why it matters: Useful for lncRNA marker prioritization and annotation choices across single-cell protocols.

Why for Yiru: Use as a candidate resource; separate expression detection, cellular localization and causal immune function.

Biomedicine #2 Distinguish KDEL-positive vesicles, ribosome association and active translation; none is an interchangeable readout.

Ribosome-associated vesicles promote activity-dependent local translation in neurons | Science Advances

AAAS: Science Advances: Table of Contents Published 2026-11-18 Peer-reviewed imaging and cell-biology study DOI: 10.1126/sciadv.aee0620

Authors: Not provided in feed

local translation subcellular organization neurons

Summary: Correlative electron microscopy and live translation imaging connect ribosome-associated vesicles with local protein synthesis in neuronal processes. Activity changes vesicle behavior differently in axons and dendrites.

Why it matters: Offers a concrete example of subcellular organization influencing local translation, beyond total RNA abundance.

Why for Yiru: Relevant background for subcellular transcriptomic and localization questions.

Biomedicine #3 Read the donor/pool design and TREM2 lineage comparison; do not treat every colocalized gene as validated.

Integrated QTL mapping and CRISPR screening in pooled iPSC-derived microglia reveals genetic drivers of neurodegenerative risk

Nature Genetics Published 2026-11-17 Peer-reviewed functional genomics study DOI: 10.1038/s41588-026-02843-0

Authors: Marta Perez-Alcantara; Sam J. Washer; Yixi Chen; Juliette Steer; Daianna Gonzalez-Padilla; Joe McWilliam; David Willé; Nikolaos Panousis; Peep Kolberg; Elena Navarro-Guerrero; Kaur Alasoo; Hazel Hall-Roberts; Julie Williams; Sally A. Cowley; Gosia Trynka; Andrew R. Bassett

eQTL CRISPR screening microglia context-dependent perturbations

Summary: Pooled iPSC-derived microglia link natural genetic variation to expression and functional traits, alongside a targeted CRISPR screen.

Why it matters: TREM2 validation uses arrayed CRISPR, antisense treatment and isogenic cells, distinguishing association from intervention.

Why for Yiru: A concrete design for connecting eQTLs with perturbation responses while retaining cellular-context dependence.

Biomedicine #4 Read paired IP/total controls and the promoter blind spot before treating signal differences as transcription-rate changes.

KAS-CUT&Tag for direct mapping of transcription bubbles

Nature Structural & Molecular Biology Published 2026-11-13 Peer-reviewed chromatin assay methods paper DOI: 10.1038/s41594-026-01917-1

Authors: Weifang Wu; Jacob E. Greene; Kami Ahmad; Steven Henikoff

transcription chromatin profiling regulatory mechanisms assay design

Summary: KAS-CUT&Tag combines exposed-ssDNA labeling with protein-targeted chromatin profiling to map transcription-associated bubbles.

Why it matters: Drug perturbations and TFIIS knockout help distinguish engaged-polymerase bubble signal from occupancy alone.

Why for Yiru: Offers a regulatory readout complementary to steady-state RNA when interpreting gene-response mechanisms.

Biomedicine #5 Read expression correction and curve filtering. Treat Nb80 recruitment as a surrogate and validate proposed allosteric sites independently.

GPCR-MAPS: high-resolution functional and allosteric mapping of G-protein-coupled receptor activation functions and bias

Nature Structural & Molecular Biology Published 2026-11-11 Peer-reviewed multiplexed functional assay DOI: 10.1038/s41594-026-01907-3

Authors: Taylor L. Mighell; Ben Lehner

GPCR signaling mutational scanning dose response functional assays

Summary: GPCR-MAPS measures receptor-variant surface expression, partner recruitment and ligand concentration responses in pooled mammalian assays.

Why it matters: Separating abundance from recruitment helps interpret apparent functional effects and signaling bias.

Why for Yiru: A useful experimental template for distinguishing expression-mediated effects from response mechanisms.

Biomedicine #6 Read the bulk-versus-transcript-specific distinction. Detailed evidence here is the earlier primary preprint, not an audited journal full text.

Proteolytic dissection of eIF4G reveals that closed-loop mRNP formation is dispensable for bulk translation in mammalian cells.

Cell Reports (via PubMed) Published 2026-11-07 Peer-reviewed study; detailed evidence additionally checked in earlier preprint DOI: 10.1016/j.celrep.2026.118259

Authors: Ryan Johnston; Mollie A Brekker; Noelle Khalil; Monty E Goldstein; Anne Aldrich; Autumn O Grimins; Sami Gritli; Assen Marintchev; Michael D Blower; Mohsan Saeed; Shawn M Lyons

translation eIF4G functional perturbation

Summary: Acute depletion and domain-rescue experiments argue that eIF4G-PABP bridging is not required for bulk translation in tested mammalian cells; cleavage fragments can instead inhibit synthesis.

Why it matters: Useful counterexample when interpreting RNA abundance and translational output as interchangeable measurements.

Why for Yiru: Read the bulk-versus-transcript-specific distinction. Detailed evidence here is the earlier primary preprint, not an audited journal full text.

Methodology Review: Woodbury updates: solve the change instead of starting again

English · About 10 minutes

Two primary full texts and two publisher abstracts inspected. No raw numerical benchmark reproduction or browser visual QA.

The intuition

Suppose a large linear system has already been factored, and the next task changes it in only one or a few directions. Starting the factorization again may discard most of the work. The Sherman–Morrison–Woodbury identity expresses the updated solution using solves with the original matrix and a smaller correction system. Low rank means few independent update directions, not necessarily few changed entries. [R1]

Imagine a shared nuisance pattern affecting every measurement. Its contribution can be dense across observations while depending on only one loading vector. That is the computational opportunity: represent the change compactly, then ask how the existing solution responds to it. The identity does not discover the nuisance pattern or certify that it should be removed. It only reorganizes the calculation once the matrices have been specified. Keep that distinction in mind whenever a fast linear-algebra trick acquires a biological interpretation.

A small worked example

Use a deliberately tiny system so that every step can be checked. Let the original two-by-two matrix be diagonal with entries two and four, and let the right-hand side be the vector (2, 4). Solving gives (1, 1). Now add the outer product of the column vector u = (1, 2) with itself. The update matrix has rows (1, 2) and (2, 4), so the modified system matrix has rows (3, 2) and (2, 8). All four entries changed, but the added matrix has rank one.

Instead of immediately solving the new system, solve the old diagonal system with u as its right-hand side. The result is z = (0.5, 0.5). The inner product of u with z is 1.5, making the scalar correction denominator 2.5. The inner product of u with the original solution is three. Divide three by 2.5 to obtain 1.2, multiply z by that value, and subtract the result from the old solution. The new answer is (0.4, 0.4). Check it directly: the modified matrix times this vector gives (2, 4), the original right-hand side.

The inverse gives a second check, although building an inverse is unnecessary for the solve. The old inverse is diagonal with entries 0.5 and 0.25. The outer product of z with itself has every entry equal to 0.25. Dividing that matrix by 2.5 gives a correction whose entries are all 0.1. Subtracting gives inverse rows (0.4, −0.1) and (−0.1, 0.15). Multiplication by the modified matrix returns the identity. For a large system, the useful object would normally be the factorization and these solves, not a freshly materialized dense inverse.

There is a subtle bookkeeping trap when the update represents a new observation in least squares. Suppose the same vector u describes that observation and its response is one. The normal-equation matrix receives the outer-product update, but the right-hand side also gains u times one. It therefore changes from (2, 4) to (3, 6). Using the updated inverse with this new right-hand side gives (0.6, 0.6), not (0.4, 0.4). The earlier result was correct for a fixed right-hand side; it would be wrong for this different task. An efficient matrix update cannot compensate for an incorrectly specified problem.

A final toy case shows why the denominator matters. Start with the two-dimensional identity matrix. Use u = (1, 0) and a different vector v = (−1 + epsilon, 0), where epsilon is a small positive number. Adding the outer product of u and v produces a diagonal matrix with entries epsilon and one. The scalar correction denominator is epsilon. A right-hand side (1, 0) now has solution (1/epsilon, 0), which becomes very large as epsilon shrinks. At zero the system is singular. This behavior is not a failure of the identity: the updated problem itself has lost an informative direction.

The necessary mathematics

Let A be an invertible n-by-n matrix, U and V be n-by-k update factors, and I_k the k-dimensional identity. Transpose is denoted by a superscript T. Define

\[B=A+UV^{\mathsf{T}},\qquad S=I_k+V^{\mathsf{T}}A^{-1}U.\]

If S is invertible, the updated matrix B is invertible and

\[B^{-1}=A^{-1}-A^{-1}US^{-1}V^{\mathsf{T}}A^{-1}.\]

For a right-hand side b, implement the identity through

\[Ay=b,\quad AZ=U,\quad Sq=V^{\mathsf{T}}y,\quad x=y-Zq.\]

Here y is the original solution, Z contains k original-system solves, q is the small-system solution, and x solves Bx = b. This formulation needs no inverse of U or V. [R1] [R2]

Assumptions and failure modes

The saving requires a reusable solve with A and a correction dimension k small enough to make forming and solving S worthwhile. A low-rank update does not mean that its amplitude is small. Repeated changes also need not remain low rank when accumulated. Those are checks on the chosen representation and workload, not consequences of the identity itself. Before adopting the update route, compare its actual cost with refactorizing the matrix for your problem size.

Exact arithmetic and floating-point arithmetic are different questions. Yip’s publisher abstract gives a stability result about the existence of suitable update factors when the original and modified matrices are well conditioned. It does not promise stability for every factorization of the same update. Therefore, do not turn that result into blanket reassurance about arbitrary factors or repeated updates. Full proof-level conditions were not inspected for this reading. [R4]

As a proposed implementation check, compute the residual with the updated matrix, not just with the small correction system. Compare selected cases against a fresh solve and inspect sensitivity when the correction denominator or small system approaches singularity. A small residual alone does not guarantee a small solution error for an ill-conditioned problem. If the matrices come from least-squares normal equations, numerical conditioning already deserves attention before any update formula is introduced.

Verified applications

Hager discusses applications including least-squares estimation and modifications of linear systems. The practical pattern is reuse of existing work after a low-rank change. These are documented numerical applications, not evidence that inverse updating is always the fastest or most accurate implementation for a particular omics workload. [R1]

Quiñonero-Candela and Rasmussen use the matrix inversion lemma in their treatment of sparse Gaussian-process regression. Their unifying account explains methods through the effective prior they employ. This gives an important distinction: the identity can evaluate a chosen low-rank model exactly while the chosen covariance remains an approximation to the original Gaussian process. Algebraic exactness should not be advertised as exact inference under an unchanged full model. [R3]

Possible transfers — speculative

A possible omics use is sensitivity analysis for a regularized model when a small set of measured covariate directions is added. Cache a suitable base factorization, express the explicit matrix change through compact factors, and update all affected right-hand sides consistently. Compare predictions with a fresh fit on a manageable subset. This is a proposed engineering transfer, not a demonstrated biological result. Changing normalization, feature selection or the response model may alter the whole system, so those operations cannot automatically be treated as the same small update.

Another possible use is evaluating a diagonal-plus-low-rank covariance model for many observations. The smaller system can make repeated calculations feasible, but the scientific question remains whether the retained factors adequately describe dependence. Test predictions and uncertainty against a richer reference on held-out data. Faster covariance solves do not by themselves validate batch correction, recover causal effects or justify using a low-rank approximation in every tissue.

The useful habit is to separate what changed from what can be reused. Write the updated matrix and right-hand side explicitly, identify the correction rank, and verify the new solution against the actual updated equations. Only then ask whether the update route saves time. Start with the small worked example, then the primary reading’s computational organization; use the stability reading to resist treating an elegant algebraic identity as a numerical guarantee.

Reading list

Page Last Updated: