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

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.

Authors

Institutions

Publication Details

Journal
bioRxiv (Cold Spring Harbor Laboratory)
Published
2026-01-20
DOI
https://doi.org/10.64898/2026.01.19.700311
Primary Topic
Genomics and Chromatin Dynamics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Johan H. Gibcus, Job Dekker, Jiangyuan Liu
bioRxiv (Cold Spring Harbor Laboratory)
Genomics and Chromatin Dynamics
article

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

Johan H. Gibcus, Job Dekker, Jiangyuan Liu
article en

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.

bioRxiv (Cold Spring Harbor Laboratory)
Howard Hughes Medical Institute (US), University of Massachusetts Chan Medical School (US)
Openalex Percentile: Top 83%
Genomics and Chromatin Dynamics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.