BiologybioRxiv

Ranked by formulaVerdict: Notable

Tensorizing Pairwise Structural Analysis: GPU-Accelerated RMSD and FCC Clustering in HADDOCK3 Without Structural Regression

Original title: Tensorizing Pairwise Structural Analysis: GPU-Accelerated RMSD and FCC Clustering in HADDOCK3 Without Structural Regression.

Integrative macromolecular docking pipelines generate thousands of candidate structural decoys, relying on downstream pairwise ensemble analysis, including Root-Mean-Square Deviation (RMSD) matrices and Fraction of…

By Salami, Kumordzi, Amuna +2

Score████░░░░░░4.5

Key numbers

  • 6.41-fold compute speedup on Apple
  • 12.2-fold end-to-end acceleration in an
  • 4.07 x 10

Caveats

  • Preprint; not yet peer reviewed.

VerdictWorth a reader's time today.

Read the originalPDF

Abstract

Integrative macromolecular docking pipelines generate thousands of candidate structural decoys, relying on downstream pairwise ensemble analysis, including Root-Mean-Square Deviation (RMSD) matrices and Fraction of Common Contacts (FCC) clustering, to identify biologically relevant binding poses. However, pairwise structural comparisons scale quadratically (O(N^2)), and canonical workflows in HADDOCK3 historically rely on disk-bound trajectory serialization and iterative CPU set operations, creating a quadratic computational and storage bottleneck for large ensembles. Here, we demonstrate that these operations can be reformulated as continuous linear algebra on GPU-resident tensors: structural superposition via batched Singular Value Decomposition (SVD) and residue contact overlap via binary matrix multiplication (M = A A^T). Across empirical benchmarks spanning N = 200 to 10,000 models (evaluating up to 49,995,000 decoy pairs), our GPU implementation achieves a 6.41-fold compute speedup on Apple Silicon (MPS) and up to 12.2-fold end-to-end acceleration in an N = 5,000 ablation on NVIDIA CUDA by eliminating trajectory disk I/O. Crucially, the implementation achieves zero downstream structural regression relative to canonical baselines, preserving identical cluster assignments (Adjusted Rand Index ARI = 1.0000, zero differing assignments) with sub-microangstrom RMSD concordance (Delta_max <= 4.07 x 10^-7 Angstrom on single-precision MPS; machine-precision Delta_max <= 8.88 x 10^-16 Angstrom on double-precision CUDA). The accelerated code, test suites, and benchmarking workflows are openly accessible on GitHub under the Apache-2.0 license.

R. O. Salami, S. M. Kumordzi, D. N. Amuna, R. A. Carr, C. M. Morang'a

The editor's rubric

Heuristic review

DimensionLevelWeightWhat that level means
Leverage███░░ 324%A method or resource many groups across the field will adopt within a year.
Magnitude███░░ 316%Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem.
Evidence████░ 420%Strong: large scale, preregistered, independently replicated, or a well-powered randomized trial.
Novelty██░░░ 220%A new combination of known ideas.
Trajectory███░░ 310%A clear path to scale.
Stakes██░░░ 210%Benefits a professional community (practitioners, clinicians, engineers).

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we report); gains (x-fold); verification (multiple benchmarks, ablations); scale (scalable, efficient).

How the score was computed

rank-2026-10-07

Score████░░░░░░4.5

Score = 10 × (75% × adjusted merit / 10 + 15% × attention + 10% × freshness)

Merit
5.8 / 10
Weighted rubric, evidence-gated.
Adjusted merit
4.8 / 10
Shrunk toward the desk prior by editor confidence (42%).
Attention
0%
Citations, upvotes, points, mentions.
Freshness
88%
Half-life decay since publication.

No attention signals recorded yet.

The record

  • Reviewed by heuristic-v6 on Oct 13, 2026, 05:48 UTC. Paper type: method.
  • Categories: bioinformatics
  • TOP, No.4 in the Biology edition of October 13, 2026.