Evidence map›Paper›PMID 41648601›Full record

ArticlebioRxiv : the preprint server for biology2026

UnionLoops: a workflow for calling chromatin loops across related Hi-C datasets with improved specificity, precision, and sensitivity.

Jiangyuan Liu, Johan H Gibcus, Job Dekker

Abstract readPreprint
In one paragraph

Article in bioRxiv : the preprint server for biology, 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

5 · Who and what money

Authors and funding

3 authors.

Jiangyuan LiuDepartment of Systems Biology, University of Massachusetts Chan Medical School; Worcester, USA.
Johan H GibcusDepartment of Systems Biology, University of Massachusetts Chan Medical School; Worcester, USA.
Job DekkerDepartment of Systems Biology, University of Massachusetts Chan Medical School; Worcester, USA.ORCID 0000-0001-5631-0698

Funding

Structural Annotation of the Human GenomeR01HG003143 · NHGRI · UNIV OF MASSACHUSETTS MED SCH WORCESTER · PI Job Dekker · 2003 to 2026
$15.4M
Center for 3D Structure and Physics of the GenomeUM1HG011536 · NHGRI · UNIV OF MASSACHUSETTS MED SCH WORCESTER · PI DEKKER, JOB, MIRNY, LEONID A · 2020 to 2024
$11.8M
NHGRI NIH HHS R01 HG003143NHGRI NIH HHS UM1 HG011536
6 · The paper itself

Abstract

Chromatin loop calling from Hi-C data often exhibits substantial variability across related samples, limiting reproducibility and complicating comparative biological analyses. Conventional loop callers such as HiCCUPS are optimized for single-sample loop detection and are not designed for consistent comparison of loop positions across multiple datasets, e.g., across conditions or time points. Here, we present UnionLoops, a computational workflow for reproducible chromatin loop calling across multiple related samples. UnionLoops integrates information across datasets to determine positions and dataset-specificity of looping interactions. It constructs a unified candidate loop set, applies consistent filtering and aggregation, and evaluates loop support across samples to distinguish shared looping interactions from dataset-specific loop calls. Using time-course Hi-C datasets, we demonstrate that UnionLoops increases sensitivity for detecting shared chromatin loops, reduces spurious sample-specific calls, and improves concordance with independent genomic features, including CTCF and cohesin occupancy. These improvements support more reliable downstream analyses and enable improved biological interpretation of chromatin loop organization and dynamics across related experimental conditions.

Identifiers

PMID41648601
PMCPMC12871756

What OpenQuestion holds

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