Evidence map›Paper›PMID 41279903›Full record

ArticlebioRxiv : the preprint server for biology2025

HDCluster: High-Degree Graph Clustering for Robust Analysis of Single Molecule Localization Microscopy.

Ismail M Khater, Ivan Robert Nabi, Ghassan Hamarneh

Abstract readPreprint
In one paragraph

Article in bioRxiv : the preprint server for biology, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Ismail M KhaterDepartment of Genetics, Harvard Medical School, Boston, MA, 02115, USA.ORCID 0000-0001-7827-7745
Ivan Robert NabiLife Sciences Institute, Department of Cellular and Physiological Sciences, School of Biomedical Engineering, University of British Columbia, Vancouver, BC V6T 1Z3, Canada.ORCID 0000-0002-0670-0513
Ghassan HamarnehMedical Image Analysis Lab, School of Computing Science, Simon Fraser University, Burnaby, BC V5A 1S6, Canada.ORCID 0000-0001-5040-7448

Funding

Center for Genome ImagingRM1HG011016 · NHGRI · HARVARD MEDICAL SCHOOL · PI WU, CHAO-TING · 2021 to 2025
$12.2M
Multiscale Analyses of 4D Nucleome Structure and Function by Comprehensive Multimodal Data IntegrationUM1HG011593 · NHGRI · CARNEGIE-MELLON UNIVERSITY · PI ALBER, FRANK, BELMONT, ANDREW STEVEN · 2020 to 2024
$10.4M
NHGRI NIH HHS RM1 HG011016NHGRI NIH HHS UM1 HG011593
6 · The paper itself

Abstract

Clustering is a fundamental task in data analysis: grouping similar objects together into distinguishable subsets. Here, we introduce HDCluster, a novel high-degree graph-based clustering algorithm designed to effectively and rapidly handle various real-world clustering applications, particularly in the context of super-resolution single molecule localization microscopy (SMLM). HDCluster efficiently handles datasets with large and variable numbers of clusters, without requiring prior knowledge of the cluster count, relying on only one parameter. The high speed and efficiency of HDCluster allow it to handle large SMLM datasets with millions of localizations. A comprehensive quantitative comparison against state-of-the-art clustering methods using simulated, public, and real-world datasets demonstrates that HDCluster outperforms other clustering algorithms in terms of time efficiency and clustering performance measures, such as ARI and AMI. HDCluster is particularly robust to noise, making it a promising and effective tool for various clustering tasks in big-data settings, such as SMLM.

Identifiers

PMID41279903
PMCPMC12633232

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.