Evidence map›Paper›PMID 42789453›Full record

ArticleJournal of chemical information and modeling2026

Candidate Structure Prioritization in Non-Target Screening with Predicted Collision Cross-Sections and Uncertainty Quantification.

Lucas Ferrando Plo, Anneli Kruve

Abstract read
In one paragraph

Article in Journal of chemical information and modeling, 2026. 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

2 authors.

Lucas Ferrando PloDepartment of Chemistry, Stockholm University, 11418Stockholm, Sweden.
Anneli KruveDepartment of Chemistry, Stockholm University, 11418Stockholm, Sweden.ORCID 0000-0001-9725-3351

Funding

European Research Council 101124488Stockholm University NA
6 · The paper itself

Abstract

Candidate structure prioritization in non-target screening (NTS) can be performed using collision cross-sections (CCSs) predicted by a machine-learning (ML) model, with a threshold on the relative difference between measured and in silico CCSs. Such thresholds generally are heuristic and lack a statistical foundation. In this context, we have constructed a conformal predictive system to quantify the uncertainty of the ML-predicted CCSs and provide guarantees on the minimum percentage of prioritized true structures among the candidate lists of the NTS features detected in a sample. The system is designed as a wrapper around the open-source ML model GraphCCS and can, in principle, be combined with any CCS model. Additionally, we propose the detection of the applicability domain of the conformal predictive system based on maximum common-edge subgraph (MCES) molecular distances. We showcase the application of our tool to two independent in silico NTS datasets. Results on the two tested external datasets suggest that applicability domain detection based on the MCES distance allows to maintain the guarantees on the minimum percentage of true structures prioritized. In terms of candidate structure prioritization performance, on average ∼16% of incorrect candidates could be deprioritized while retaining 90% of all true structures. Although this constitutes a modest 8% improvement over random prioritization, our tool additionally offers adaptivity of removal efficiency to the difficulty of the NTS candidates based on quantified uncertainty. Furthermore, the framework can potentially be combined with other analytical properties to improve candidate structure prioritization in NTS.

Identifiers

PMID42789453
PMCPMC13663483

What OpenQuestion holds

Textmetadata
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.