SemanticST: A Scalable Multi-Contextual Graph Learning Framework for Uncovering Spatial Niches and Robust Multi-Sample Integration in Spatial Transcriptomics.
The 9 matches
- [1] § Results › Overview of SemanticST ↔ semanticst/SemanticST_main.py, lines 28–110 · score 0.77 · min cut loss, reconstruction loss, learning embedding, learned semantic graphs, adjacency matrix, optimization
- [2] § Method › SemanticST › Semantic Graph Learning ↔ semanticst/model.py, lines 145–210 · score 0.70 · GCN layers, activation function, feature matrix, semantic graph, nodes, encoder
- [3] § Method › Mini‐Batch Training ↔ semanticst/loading_batches.py, lines 126–182 · score 0.68 · DataLoader, PyTorch, mini batch, shuffling, training, spots
- [4] § Method › Mini‐Batch Training ↔ semanticst/SemanticST_main.py, lines 28–110 · score 0.68 · DataLoader, spatial graph, adjacency matrix, iteration, reconstructed, PyTorch
- [5] § Method › SemanticST's Objective Function › Community‐Based Detection Loss Function ↔ semanticst/SemanticST_main.py, lines 264–334 · score 0.62 · min cut loss, learned embedding, optimize, semantic graphs, reconstruction, encoders
- [6] § Method › Data Preprocessing ↔ semanticst/preprocess.py, lines 131–147 · score 0.61 · variable genes, Scanpy, filtered, Preprocessing, Xenium, cells
- [7] § Method › SemanticST's Objective Function › Community‐Based Detection Loss Function ↔ semanticst/model.py, lines 75–122 · score 0.60 · Gumbel Softmax, mincut loss, Detection, embedding, matrix, graph
- [8] § Method › SemanticST ↔ semanticst/Semantic_graphs.py, lines 85–203 · score 0.56 · graph neural network, Semantic graph learning, GNN, loss
- [9] § Method › SemanticST › Fusion of the Latent Representations for Each Semantic Graph ↔ semanticst/model.py, lines 145–210 · score 0.55 · node feature matrix, encoding, fused, decoder, Fusion, encoder
Paper
Loaded from Europe PMC by your browser, not stored by OSCR: doi.org · Europe PMC
The paper is loaded when this pane is shown.
The authors' code
Python · 451 lines · 18 KB · MIT · 3 matches
- #!/usr/bin/env python3
- # -*- coding: utf-8 -*-
- """
- Created on Wed Mar 27 11:31:26 2024
- @author: Roxana
- """
- import numpy as np
- import scipy.sparse as sp
- import torch
- import torch.nn.functional as F
- from tqdm import tqdm
- from .preprocess import (
- preprocess,
- construct_interaction,
- construct_interaction_KNN,
- construct_interaction_KNN_edge_index,
- construct_sparse_graph,
- sparse_mx_to_torch_sparse_tensor,
- fix_seed,
- )
- from .model import Encoder, DeepMinCutModel
- from .Semantic_graphs import SemanticGraphLearning
- class Semantic_batches():
- """
- A class for learning semantic representations from spatial transcriptomics (ST) data
- using graph-based methods.
- This class constructs spatial graphs, applies deep learning-based feature extraction,
- and integrates reconstruction loss and MinCut loss to enhance the learned embeddings.
- Parameters
- ----------
- adata : anndata.AnnData
- AnnData object containing spatial transcriptomics data.
- train_loader : torch.utils.data.DataLoader
- DataLoader for training batches of spatial transcriptomics data.
- test_loader : torch.utils.data.DataLoader
- DataLoader for testing batches of spatial transcriptomics data.
- num_iter : int
- Number of iterations (batches) per epoch.
- config : object
- Configuration object containing device, data type, and other hyperparameters.
- learning_rate : float, optional, default=0.001
- Learning rate for optimizing the model.
- weight_decay : float, optional, default=0.00
- Regularization parameter controlling weight decay in the optimizer.
- epochs : int, optional, default=1
- Number of training epochs.
- dim_output : int, optional, default=64
- Dimensionality of the output embeddings.
- alpha : float, optional, default=1
- Weight factor controlling the influence of the reconstruction loss in representation learning.
- beta : float, optional, default=0.1
- Weight factor controlling the influence of the **MinCut loss** in representation learning.
- Integration : bool, optional, default=True
- Whether to integrate additional data sources in representation learning.
- Attributes
- ----------
- dim_input : int
- Dimensionality of the input features.
- device : str
- Computation device (`'cpu'` or `'cuda'`), retrieved from config.
- adj : torch.Tensor
- Adjacency matrix representing the spatial interactions between spots.
- edge_index : torch.Tensor
- Edge list representing graph connectivity.
- G : list
- List of semantic graphs constructed during training.
- emb_rec : np.ndarray
- Learned representations from the decoder.
- emb_h : np.ndarray
- Learned representations from the encoder.
- Methods
- -------
- train():
- Trains the semantic graph learning model on ST data using reconstruction loss and MinCut loss.
- test():
- Evaluates the trained model and extracts representations.
- Returns
- -------
- anndata.AnnData
- Updated AnnData object with learned embeddings stored in `adata.obsm['emb_decoder']`
- and `adata.obsm['emb_encoder']`.
- """
- def __init__(
- self,
- adata,
- train_loader,
- test_loader,
- num_iter,
- config,
- learning_rate=0.001,
- weight_decay=0.00,
- epochs=1000,
- dim_output=64,
- alpha=1,
- beta=0.1,
- Integration=True
- ):
- self.adata = adata
- self.train_loader = train_loader
- self.test_loader = test_loader
- self.config = config
- self.learning_rate = learning_rate
- self.weight_decay = weight_decay
- self.epochs = epochs
- self.datatype = self.config.dtype
- self.alpha = alpha
- self.beta = beta
- self.Integration = Integration
- self.device = self.config.device
- fix_seed(self.config.seed)
- batch, _ids = next(iter(train_loader))
- self.num_iter = num_iter
- self.dim_input = batch[:, :-2].shape[1]
- self.dim_output = dim_output
- print("\n🚀 Welcome to SemanticST! 🚀\n")
- print("📢 Recommendation: If your dataset contains more than 40000 spots or cells, we suggest using **mini-batch training** for efficiency.")
- def train(self):
- print("\n✅ Using Mini-Batch Training for better efficiency! 🏋️♂️")
- self.min_model = DeepMinCutModel()
- print('Begin to train ST data...')
- self.loss = 0
- total_loss = 0
- batch_idx = 0
- self.model = Encoder(self.dim_input, self.dim_output, num_graphs=4).to(self.device)
- self.optimizer = torch.optim.Adam(self.model.parameters(), self.learning_rate,
- weight_decay=self.weight_decay)
- for batch_idx, (data, ids) in enumerate(tqdm(self.train_loader, total=self.num_iter, desc="Training Progress")):
- spot_data = data.float()
- num_nodes = data.shape[0]
- coor = spot_data[:, -2:]
- coor = coor.to(torch.int)
- W = []
- self_loops = torch.arange(num_nodes, device=self.device)
- self_loops = torch.stack([self_loops, self_loops], dim=0)
- if self.datatype in ['Stereo', 'Slide']:
- self.adj = construct_sparse_graph(coor) # scipy sparse, stays sparse
- gn = self.adj + sp.eye(self.adj.shape[0])
- self.graph_neigh = sparse_mx_to_torch_sparse_tensor(gn).to(self.device) # binary mask
- self.edge_index = construct_interaction_KNN_edge_index(coor).to(self.device)
- else:
- self.adj, self.graph_neigh = construct_interaction(coor)
- self.graph_neigh = torch.FloatTensor(self.graph_neigh + np.eye(self.adj.shape[0])).to(self.device)
- self.adj = torch.FloatTensor(self.adj).to(self.device)
- self.edge_index = self.adj.nonzero().t()
- self.edge_index = torch.cat((self.edge_index, self_loops), dim=1)
- self.loop_weight = torch.full((num_nodes,), 0.1).to(self.device)
- self.sg_learning = SemanticGraphLearning(spot_data[:, :-2], self.adj, self.edge_index, self.device, self.config.use_mini_batch, self.datatype)
- self.G = self.sg_learning.train()
- for i in range(len(self.G)):
- if self.datatype in ['Stereo', 'Slide']:
- self.new_edge_weight = self.G[i]
- else:
- self.new_edge_weight = torch.cat((self.G[i], self.loop_weight))
- W.append(self.new_edge_weight)
- spot_data = torch.FloatTensor(spot_data[:, :-2])
- feature = spot_data.to(self.device)
- self.adj_weighted = self.edge_weights_to_sparse(num_nodes)
- for epoch in range(self.epochs):
- self.model.train()
- self.hiden_feat, self.emb, self.g, self.hidden_embeddings, self.attn_weights = self.model(feature, self.edge_index, self.graph_neigh, W)
- self.loss_feat = F.mse_loss(feature, self.emb)
- self.loss_deep_mincut = self.min_model.deep_mincut_loss(self.hiden_feat, self.adj_weighted)
- loss = self.alpha * self.loss_feat + self.beta * self.loss_deep_mincut
- self.optimizer.zero_grad()
- loss.backward()
- self.optimizer.step()
- total_loss += loss.data.item()
- batch_idx += 1
- self.loss = total_loss / (batch_idx + 1)
- del self.edge_index, self.adj, spot_data, self.graph_neigh, self.G
- del self.loop_weight, self.adj_weighted
- print("Optimization finished for ST data!")
- with torch.no_grad():
- self.model.eval()
- Emb_e = []
- Emb_d = []
- for batch_idx, (data, ids) in enumerate(tqdm(self.test_loader, desc="Testing Progress", unit="batch")):
- spot_data = data.float()
- num_nodes = data.shape[0]
- coor = spot_data[:, -2:]
- W = []
- self_loops = torch.arange(num_nodes, device=self.device)
- self_loops = torch.stack([self_loops, self_loops], dim=0)
- if self.datatype in ['Stereo', 'Slide']:
- self.adj, self.graph_neigh = construct_interaction_KNN(coor)
- self.graph_neigh = torch.FloatTensor(self.graph_neigh + np.eye(self.adj.shape[0])).to(self.device)
- self.edge_index = construct_interaction_KNN_edge_index(coor).to(self.device)
- self.adj = torch.FloatTensor(self.adj).to(self.device)
- else:
- self.adj, self.graph_neigh = construct_interaction(coor)
- self.graph_neigh = torch.FloatTensor(self.graph_neigh + np.eye(self.adj.shape[0])).to(self.device)
- self.adj = torch.FloatTensor(self.adj).to(self.device)
- self.edge_index = self.adj.nonzero().t()
- self.edge_index = torch.cat((self.edge_index, self_loops), dim=1)
- self.loop_weight = torch.full((num_nodes,), 0.1).to(self.device)
- self.sg_learning = SemanticGraphLearning(spot_data[:, :-2], self.adj, self.edge_index, self.device, self.config.use_mini_batch, self.datatype)
- self.G = self.sg_learning.evaluate(spot_data[:, :-2])
- for i in range(len(self.G)):
- if self.datatype in ['Stereo', 'Slide']:
- self.new_edge_weight = self.G[i]
- else:
- self.new_edge_weight = torch.cat((self.G[i], self.loop_weight))
- W.append(self.new_edge_weight)
- spot_data = torch.FloatTensor(spot_data[:, :-2])
- feature = spot_data.to(self.device)
- self.emb_rec = self.model(feature, self.edge_index, self.graph_neigh, W)[1].detach()
- self.emb_h = self.model(feature, self.edge_index, self.graph_neigh, W)[0].detach()
- Emb_d.append(self.emb_rec.cpu().numpy())
- Emb_e.append(self.emb_h.cpu().numpy())
- Emb_d = np.concatenate(Emb_d, axis=0)
- Emb_e = np.concatenate(Emb_e, axis=0)
- self.adata.obsm['emb_decoder'] = Emb_d
- self.adata.obsm['emb_encoder'] = Emb_e
- return self.adata
- def edge_weights_to_sparse(self, num_nodes):
- A = torch.sparse_coo_tensor(
- self.edge_index, self.new_edge_weight,
- (num_nodes, num_nodes), device=self.device,
- )
- return (A + A.t()).coalesce()
- class Semantic():
- """
- A class for training a semantic graph learning model on full spatial transcriptomics (ST) data
- without mini-batch training.
- This class constructs spatial graphs, applies deep learning-based feature extraction,
- and integrates reconstruction loss and MinCut loss to enhance the learned embeddings.
- Parameters
- ----------
- adata : anndata.AnnData
- AnnData object containing spatial transcriptomics data.
- config : object
- Configuration object containing device, data type, and other hyperparameters.
- learning_rate : float, optional, default=0.001
- Learning rate for optimizing the model.
- weight_decay : float, optional, default=0.00
- Regularization parameter controlling weight decay in the optimizer.
- epochs : int, optional, default=1000
- Number of training epochs.
- dim_input : int, optional, default=3000
- Dimensionality of the input features.
- dim_output : int, optional, default=64
- Dimensionality of the output embeddings.
- alpha : float, optional, default=10
- Weight factor controlling the influence of the reconstruction loss in representation learning.
- beta : float, optional, default=0.1
- Weight factor controlling the influence of the **MinCut loss** in representation learning.
- Integration : bool, optional, default=True
- Whether to integrate additional data sources in representation learning.
- Attributes
- ----------
- device : str
- Computation device (`'cpu'` or `'cuda'`), retrieved from config.
- adj : torch.Tensor
- Adjacency matrix representing the spatial interactions between spots.
- edge_index : torch.Tensor
- Edge list representing graph connectivity.
- G : list
- List of semantic graphs constructed during training.
- emb_rec : np.ndarray
- Learned representations from the decoder.
- emb_h : np.ndarray
- Learned representations from the encoder.
- Methods
- -------
- train():
- Trains the semantic graph learning model on the full dataset without mini-batching.
- Returns
- -------
- anndata.AnnData
- Updated AnnData object with learned embeddings stored in `adata.obsm['emb_decoder']`
- and `adata.obsm['emb_encoder']`.
- """
- def __init__(self,
- adata, config,
- learning_rate=0.001,
- weight_decay=0.00,
- epochs=1000,
- dim_input=3000,
- dim_output=64,
- alpha=10,
- beta=0.1,
- lambda_factor=0.1,
- Integration=True
- ):
- self.adata = adata.copy()
- self.config = config
- self.learning_rate = learning_rate
- self.weight_decay = weight_decay
- self.epochs = epochs
- self.random_seed = self.config.seed
- self.alpha = alpha
- self.beta = beta
- self.Integration = Integration
- self.datatype = self.config.dtype
- self.dim_input = dim_input
- self.dim_output = dim_output
- self.device = self.config.device
- self.lambda_factor = lambda_factor
- fix_seed(self.config.seed)
- print("\n🚀 Welcome to SemanticST! 🚀\n")
- print("📢 Recommendation: If your dataset contains more than 40000 spots or cells, we suggest using **mini-batch training** for efficiency.")
- def train(self):
- print("\n✅ Using Full Dataset Training (No Mini-Batching). 🔥")
- preprocess(self.adata, self.datatype)
- self.min_model = DeepMinCutModel()
- print('Begin to train ST data...')
- data = self.adata.obsm['feat'].copy()
- self.dim_input = data.shape[1]
- num_nodes = data.shape[0]
- coor = self.adata.obsm['spatial']
- coor = torch.from_numpy(coor).to(device=self.device, dtype=torch.int)
- W = []
- self_loops = torch.arange(num_nodes, device=self.device)
- self_loops = torch.stack([self_loops, self_loops], dim=0)
- if self.datatype in ['Stereo', 'Slide']:
- self.adj = construct_sparse_graph(coor) # scipy sparse, stays sparse
- gn = self.adj + sp.eye(self.adj.shape[0])
- self.graph_neigh = sparse_mx_to_torch_sparse_tensor(gn).to(self.device) # binary mask
- self.edge_index = construct_interaction_KNN_edge_index(coor).to(self.device)
- else:
- self.adj, self.graph_neigh = construct_interaction(coor)
- self.graph_neigh = torch.FloatTensor(self.graph_neigh + np.eye(self.adj.shape[0])).to(self.device)
- self.adj = torch.FloatTensor(self.adj).to(self.device)
- self.edge_index = self.adj.nonzero().t()
- self.edge_index = torch.cat((self.edge_index, self_loops), dim=1)
- self.loop_weight = torch.full((num_nodes,), 0.1).to(self.device)
- self.sg_learning = SemanticGraphLearning(data, self.adj, self.edge_index, self.device, self.config.use_mini_batch, self.datatype, lambda_factor=self.lambda_factor)
- self.sg_learning.train()
- self.G = self.sg_learning.evaluate(data)
- print("Semantic Graph Learning Completed")
- num_graphs = len(self.G[1])
- self.model = Encoder(self.dim_input, self.dim_output, num_graphs=num_graphs).to(self.device)
- self.optimizer = torch.optim.Adam(self.model.parameters(), self.learning_rate,
- weight_decay=self.weight_decay)
- for i in range(len(self.G)):
- if self.datatype in ['Stereo', 'Slide']:
- self.new_edge_weight = self.G[i]
- else:
- self.new_edge_weight = torch.cat((self.G[i], self.loop_weight))
- W.append(self.new_edge_weight)
- data = torch.FloatTensor(data)
- feature = data.to(self.device)
- self.adj_weighted = self.edge_weights_to_sparse(num_nodes)
- for epoch in tqdm(range(self.epochs), desc="Feature Learning Epochs"):
- self.model.train()
- self.hiden_feat, self.emb, self.g, self.hidden_embeddings, self.attn_weights = self.model(feature, self.edge_index, self.graph_neigh, W)
- self.loss_feat = F.mse_loss(feature, self.emb)
- self.loss_deep_mincut = self.min_model.deep_mincut_loss(self.hiden_feat, self.adj_weighted)
- loss = self.alpha * self.loss_feat + self.beta * self.loss_deep_mincut
- self.optimizer.zero_grad()
- loss.backward()
- self.optimizer.step()
- with torch.no_grad():
- self.model.eval()
- data = torch.FloatTensor(data)
- feature = data.to(self.device)
- self.emb_rec = self.model(feature, self.edge_index, self.graph_neigh, W)[1].detach()
- self.emb_h = self.model(feature, self.edge_index, self.graph_neigh, W)[0].detach()
- self.adata.obsm['emb_decoder'] = self.emb_rec.cpu().numpy()
- self.adata.obsm['emb_encoder'] = self.emb_h.cpu().numpy()
- return self.adata
- def edge_weights_to_sparse(self, num_nodes):
- A = torch.sparse_coo_tensor(
- self.edge_index, self.new_edge_weight,
- (num_nodes, num_nodes), device=self.device,
- )
- return (A + A.t()).coalesce()
- def cosine_similarity(self, pred_sp, emb_sp): # pred_sp: spot x gene; emb_sp: spot x gene
- """
- Calculate cosine similarity based on predicted and reconstructed gene expression matrix.
- """
- M = torch.matmul(pred_sp, emb_sp.T)
- Norm_c = torch.norm(pred_sp, p=2, dim=1)
- Norm_s = torch.norm(emb_sp, p=2, dim=1)
- Norm = torch.matmul(Norm_c.reshape((pred_sp.shape[0], 1)), Norm_s.reshape((emb_sp.shape[0], 1)).T) + -5e-12
- M = torch.div(M, Norm)
- if torch.any(torch.isnan(M)):
- M = torch.where(torch.isnan(M), torch.full_like(M, 0.4868), M)
- return M
SemanticST_main.py at commit ad3f204, under MIT · at the source
Overview
- UNSW BioMedical Machine Learning Lab (BML), School of Biomedical Engineering, UNSW Sydney, Sydney, Australia
- School of Biomedical Engineering, UNSW Sydney, Sydney, Australia
- Tyree Institute of Health Engineering (IHealthE), UNSW Sydney, Sydney, Australia
- Center of Excellence in Precision Medicine and Digital Health, Department of Physiology, Faculty of Dentistry, Chulalongkorn University, Bangkok, Thailand
- Clinic of General, Special Care and Geriatric Dentistry, Center for Dental Medicine, University of Zurich, Zurich, Switzerland
- Center for Immune‐Related Diseases, Shanghai Institute of Immunology, Shanghai Jiao Tong University School of Medicine, Shanghai, China
- Visiting Scholar (Collaborative Projects), Center of Excellence in Precision Medicine and Digital Health, Chulalongkorn University, Bangkok, Thailand
Abstract
Spatial transcriptomics (ST) analysis is often hindered by technical limitations and methodological biases that let dominant signals overshadow subtle but crucial biological patterns, such as rare cell types and fine‐grained heterogeneity. This is especially true for high‐complexity datasets from platforms like Xenium. We present SemanticST, a graph neural network (GNN) framework that addresses this challenge through a fundamentally different design. SemanticST is the first GNN method to implement mini‐batch training, enabling scalable analysis of massive ST datasets (validated on Xenium). Crucially, it employs a multi‐semantic graph fusion strategy that learns disentangled biological representations across tissue, using a min‐cut loss that requires neither graph corruption nor contrastive sampling. Benchmarking across diverse tissues (e.g., brain, embryo, tumor) confirms consistent superiority. It achieves up to 20% higher ARI/
Reproduced under the paper's license (CC BY), from the paper cited above.
Repository
Its files are read in the Code ↔ Paper reader above, with 9 matches between paragraphs and lines of code.
roxana9/SemanticST
ad3f2041f38927709f00df70bcda35ca19f08cf7, 7 September 2026Availability: 1 check, the latest on 27 September 2026: the link answers
- 27 September 2026: the link answers
25 files
- Benchmark/
Run_DLPFC_DeepST.py , Python, 101 lines - Benchmark/
Run_DLPFC_GraphST.py , Python, 166 lines - Benchmark/
Run_DLPFC_SEDR.py , Python, 175 lines - Benchmark/
Run_DLPFC_SemanticST.py , Python, 178 lines - build/
lib/ , Python, 532 linessemanticst/ SemanticST_main.py - build/
lib/ , Python, 205 linessemanticst/ Semantic_graphs.py - build/
lib/ , Python, 105 linessemanticst/ Semantic_layers.py - build/
lib/ , Python, 19 linessemanticst/ __init__.py - build/
lib/ , Python, 182 linessemanticst/ loading_batches.py - build/
lib/ , Python, 33 linessemanticst/ main.py - build/
lib/ , Python, 217 linessemanticst/ model.py - build/
lib/ , Python, 173 linessemanticst/ preprocess.py - build/
lib/ , Python, 74 linessemanticst/ utils.py - semanticst/
SemanticST_main.py , Python, 451 lines, 3 matches - semanticst/
Semantic_graphs.py , Python, 205 lines, 1 match - semanticst/
Semantic_layers.py , Python, 105 lines - semanticst/
__init__.py , Python, 19 lines - semanticst/
loading_batches.py , Python, 182 lines, 1 match - semanticst/
main.py , Python, 33 lines - semanticst/
model.py , Python, 212 lines, 3 matches - semanticst/
preprocess.py , Python, 204 lines, 1 match - semanticst/
utils.py , Python, 74 lines - setup.py, Python, 38 lines
- LICENSE, License, 21 lines
- README.md, Text, 83 lines
Code Availability
The SemanticST algorithm is an open‐source Python implementation available at https://
Reproduced under the paper's license (CC BY), from the paper cited above.
Tracing map
Proposed by the machine: these links were found in the paper and verified at the source, without human review. The map will receive a Zenodo DOI once one of the paper's authors has validated it with their ORCID.
What the map holds:
- 1 repository of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
- 23 scripts, each with its path and the digest of its content;
- 9 matches between paragraphs of the paper and lines of the code (method lexical-v1);
- neither the text of the paper nor the code itself.
Its JSON (tracing-map.json) is deposited on Zenodo with its DOI once the map is validated.
Data
Datasets cited
- zenodo:15339700, at Zenodo; found in “Data Availability Statement”
Data Availability Statement
All data used in this study were obtained from previously published sources. A comprehensive list of these sources is provided in Table S3. For convenience, we have also made the compiled data available via Zenodo: https://
Reproduced under the paper's license (CC BY), from the paper cited above.
Versions
The history of this record: each version stored by the harvester or made by a correction of its authors or of the maintainers of its code, and what changed in its facts. The texts of the paper (its abstract, its availability statements) are not part of it; versions that changed only those are not listed.
Version 1, 27 September 2026: the first record
Recorded: type, language, journal, pages, dates, 8 authors, 4 keywords, 7 funders, 61 references.
Cite
This paper
Zahedi, R., Argha, A., Farbehi, N., Bakhshayeshi, I., Porntaveetus, T., Ye, Y., Lovell, N. H., & Alinejad‐Rokny, H. (2026). SemanticST: A Scalable Multi-Contextual Graph Learning Framework for Uncovering Spatial Niches and Robust Multi-Sample Integration in Spatial Transcriptomics. Advanced science (Weinheim, Baden-Wurttemberg, Germany), e77003. https://
BibTeX
@article{zahedi2026seman
author = {Zahedi, Roxana and Argha, Ahmadreza and Farbehi, Nona and Bakhshayeshi, Ivan and Porntaveetus, Thantrira and Ye, Youqiong and Lovell, Nigel H and Alinejad‐Rokny, Hamid},
title = {{SemanticST: A Scalable Multi-Contextual Graph Learning Framework for Uncovering Spatial Niches and Robust Multi-Sample Integration in Spatial Transcriptomics}},
journal = {Advanced science (Weinheim, Baden-Wurttemberg, Germany)},
year = {2026},
month = aug,
pages = {e77003},
publisher = {Wiley},
issn = {2198-3844},
doi = {10.1002/
url = {https://
pmid = {42671391},
pmcid = {PMC13528690}
}
RIS
TY - JOUR
AU - Zahedi, Roxana
AU - Argha, Ahmadreza
AU - Farbehi, Nona
AU - Bakhshayeshi, Ivan
AU - Porntaveetus, Thantrira
AU - Ye, Youqiong
AU - Lovell, Nigel H
AU - Alinejad‐Rokny, Hamid
TI - SemanticST: A Scalable Multi-Contextual Graph Learning Framework for Uncovering Spatial Niches and Robust Multi-Sample Integration in Spatial Transcriptomics
T2 - Advanced science (Weinheim, Baden-Wurttemberg, Germany)
J2 - Adv Sci (Weinh)
PY - 2026
DA - 2026/
SP - e77003
SN - 2198-3844
PB - Wiley
DO - 10.1002/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1002/
"type": "article-journal",
"title": "SemanticST: A Scalable Multi-Contextual Graph Learning Framework for Uncovering Spatial Niches and Robust Multi-Sample Integration in Spatial Transcriptomics",
"container-title": "Advanced science (Weinheim, Baden-Wurttemberg, Germany)",
"author": [
{
"family": "Zahedi",
"given": "Roxana"
},
{
"family": "Argha",
"given": "Ahmadreza"
},
{
"family": "Farbehi",
"given": "Nona"
},
{
"family": "Bakhshayeshi",
"given": "Ivan"
},
{
"family": "Porntaveetus",
"given": "Thantrira"
},
{
"family": "Ye",
"given": "Youqiong"
},
{
"family": "Lovell",
"given": "Nigel H"
},
{
"family": "Alinejad‐Rokny",
"given": "Hamid"
}
],
"container-title-short":
"page": "e77003",
"DOI": "10.1002/
"PMID": "42671391",
"PMCID": "PMC13528690",
"ISSN": "2198-3844",
"publisher": "Wiley",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
8,
31
]
]
}
}
The tracing map gets a citation of its own once an author has validated it and it has a DOI.
Similar papers
The papers with a page that share the most with this one: the tools found in their code, their categories, datasets, cited references and authors, the rarest counting most.
- [1] doi:10.1093/bioinformatics/btag540 [code]
- Deciphering spatial heterogeneity by multimodal spatial transcriptomics modelling with SpatialModal.Journal: Bioinformatics (Oxford, England)In common: rpy2, PyTorch Geometric, anndata, 10 other tools, methods / tools, genetics / omics, 15 references
- [2] doi:10.21203/rs.3.rs-9676637/v1 [code]
- A Comprehensive Benchmarking of Spatial Deconvolution and Domain Detection Methods across Diverse Tissues and Spatial Transcriptomic TechnologiesJournal: Research Square (preprint)In common: rpy2, PyTorch Geometric, anndata, 10 other tools, methods / tools, genetics / omics, 10 references
- [3] doi:10.1093/bib/bbag298 [code]
- Empowering multifaceted analysis of spatial transcriptomics data with RGAST.Journal: Briefings in bioinformaticsIn common: rpy2, PyTorch Geometric, anndata, 9 other tools, methods / tools, genetics / omics, 11 references
- [4] doi:10.1038/s41592-026-03194-8 [code]
- Beyond benchmarking: an expert-guided consensus approach to spatially aware clustering.Journal: Nature methodsIn common: rpy2, PyTorch Geometric, anndata, 8 other tools, methods / tools, genetics / omics, 12 references
- [5] doi:10.1038/s41467-026-71759-4 [code]
- CellNiche represents cellular microenvironments in atlas-scale spatial omics data with contrastive learning.Journal: Nature communicationsIn common: PyTorch Geometric, anndata, Scanpy, 7 other tools, 10 references
- [6] doi:10.1002/advs.75969 [code]
- Accurately Deciphering Tissue Heterogeneity From Spatial Multi-Modal and Multi-Omics With STransformer.Journal: Advanced science (Weinheim, Baden-Wurttemberg, Germany)In common: PyTorch Geometric, anndata, Scanpy, 6 other tools, genetics / omics, 8 references
- [7] doi:10.1371/journal.pcbi.1014346 [code]
- StPedf: Cell trajectory inference of spatial transcriptomics via spatial proximity embedding and spatial density-adaptive fusion.Journal: PLoS computational biologyIn common: rpy2, anndata, Scanpy, 7 other tools, genetics / omics, 7 references
- [8] doi:10.1093/bioinformatics/btag430 [code]
- SPIDER: spatially integrated denoising via embedding regularization with single cell supervision.Journal: Bioinformatics (Oxford, England)In common: rpy2, PyTorch Geometric, anndata, 7 other tools, genetics / omics, 6 references
- [9] doi:10.1016/j.isci.2026.117206 [code]
- ReliST: A model-agnostic risk layer for spatial transcriptomics deconvolution.Journal: iScienceIn common: anndata, Scanpy, PyTorch, 6 other tools, genetics / omics, 8 references
- [10] doi:10.1093/nar/gkag706 [code]
- scDifformer: diffusion-based post-training for virtual cell modeling across large-scale single-cell data.Journal: Nucleic acids researchIn common: PyTorch Geometric, anndata, Numba, 10 other tools, 3 references
Contribute
The authors of this paper can claim it, correct its record and validate its tracing map, and the maintainers of its code (its owner, or a public member of its organization) correct what it says of their repository; anyone signed in can ask for its removal. Every request goes to OSCR's own machine, which answers it; your account page follows them.
Sign in with ORCID to claim this paper as one of its authors, correct its record or validate its tracing map: when the paper's metadata lists your ORCID iD, you are recognized at once. Maintainers of its code: sign in with GitHub, then claim the repository on your account page.
Claim this paper
Correct its record
Say what each link of this record is, remove the ones that are not the paper's, add the ones that are missing. The correction becomes a new version of the record, in its Versions section.
Validate its tracing map
You validate the map as this page shows it: 1 repository of the authors' code, each at its verified commit and with its license, 23 scripts, and 9 matches between paragraphs and code (see the Code and Map sections). It then receives a DOI on Zenodo, with you (your ORCID iD) and OSCR as its creators; the code itself is not deposited.
The map's fingerprint: sha256:d18a0f96b795e7b4…
Add the badge to its README
The badge links the code to this page. Copy one of these into the README of the paper's code: only you decide where it goes, and nothing is changed for you.
Markdown
[, paste the snippet at the top, then “Commit changes…” and, to review it first, “Create a new branch and start a pull request”. You open the pull request; OSCR asks for no permission.
Request its removal
To ask OSCR to remove this record, the copies of its authors' scripts or its tracing map, use the removal request page: signed in, you say who you are, what to remove and why, then review and confirm the request. Published rules decide every request (how).
Discussion, reproductions, activity
Discussion: questions and error reports about this paper and its code, from signed-in readers and its authors. It opens with sign-in.
Reproductions: reports from readers who ran the authors' code: what they reproduced, with which environment, commit and data. It opens with sign-in.
Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.
