Evidence map›Paper›PMID 42660940›Full record

ArticleNature communications2026

Combinatorial group testing for efficient scaling across biological applications.

Lorenzo Talamanca, Julian Trouillon

Abstract read
In one paragraph

Article in Nature communications, 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.

Lorenzo TalamancaInstitute of Molecular Systems Biology, ETH Zürich, Zürich, Switzerland.ORCID 0000-0002-0846-7946
Julian TrouillonInstitute of Molecular Systems Biology, ETH Zürich, Zürich, Switzerland. jtrouillon@ethz.ch.ORCID 0000-0003-1675-0896

Funding

Eidgenössische Technische Hochschule Zürich (Federal Institute of Technology Zurich) 2023-622Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (Swiss National Science Foundation) PZ00P3 223880
6 · The paper itself

Abstract

Combinatorial group testing can reduce experimental costs and turnaround time by strategically pooling samples to minimize the number of measurements needed for a given experiment. Despite broad potential utility, it remains underutilized due to its intrinsic complexity and the lack of implementation tools. Here we present PoolPy, a unified end-to-end framework and web platform to benchmark, automate, and decode combinatorial group testing strategies. PoolPy tailors pooling designs to application-specific constraints, such as time, cost, or signal dilution, across experiment types. By implementing ten different pooling algorithms, which we comprehensively benchmark in silico across >100,000 conditions, we identify key design trade-offs that define pooling applicability to specific use cases. We experimentally validate PoolPy across diverse applications, including protein-ligand interaction screening, RT-qPCR viral testing and genome-wide protein-DNA interaction profiling, achieving a 60 to 93% reduction in number of measurements needed. Overall, PoolPy provides a scalable, user-friendly ecosystem to increase throughput and reduce costs across biological applications. PoolPy is available at https://poolpy.trouillonlab.org  for open use.

Indexed as

SoftwareAlgorithmsComputer SimulationLigandsPooled TestingLigands

Identifiers

PMID42660940
PMCPMC13522496

What Socratic 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 Socratic graph.