.png){kind=icon}
Return
Stardust: improving spatial transcriptomics data analysis through space-aware modularity optimization-based clustering
.png){kind=icon}
OA
AI
DOI：10.1093/gigascience/giac075.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Background Spatial transcriptomics (ST) combines stained tissue images with spatially resolved high-throughput RNA sequencing. The spatial transcriptomic analysis includes challenging tasks like clustering, where a partition among data points (spots) is defined by means of a similarity measure. Improving clustering results is a key factor as clustering affects subsequent downstream analysis. State-of-the-art approaches group data by taking into account transcriptional similarity and some by exploiting spatial information as well. However, it is not yet clear how much the spatial information combined with transcriptomics improves the clustering result. Results We propose a new clustering method, Stardust, that easily exploits the combination of space and transcriptomic information in the clustering procedure through a manual or fully automatic tuning of algorithm parameters. Moreover, a parameter-free version of the method is also provided where the spatial contribution depends dynamically on the expression distances distribution in the space. We evaluated the proposed methods results by analyzing ST data sets available on the 10x Genomics website and comparing clustering performances with state-of-the-art approaches by measuring the spots' stability in the clusters and their biological coherence. Stability is defined by the tendency of each point to remain clustered with the same neighbors when perturbations are applied. Conclusions Stardust is an easy-to-use methodology allowing to define how much spatial information should influence clustering on different tissues and achieving more stable results than state-of-the-art approaches.
Keywords:
spatial transcriptomics analysis
clustering
stability scores
parameters tuning
software comparison
Journal
IF:
3.9
Papers:
1.6K
Citations:
1.4W
Organization
Cited Papers
Comparison between Single and Multi-Objective Evolutionary Algorithms to Solve the Knapsack Problem and the Travelling Salesman Problem.png)
MathematicsOAAI
MathematicsIF0
OAAIShareSave
ShareSaveIntegrating single-cell transcriptomic data across different conditions, technologies, and speciesNATURE BIOTECHNOLOGYOAAI
NATURE BIOTECHNOLOGYIF41.7
OAAIShareSaveShareSaveShareSaveShareSaveShareSave
View more