Inferensys

Glossary

Peak Calling

The computational process of analyzing ChIP-seq or ATAC-seq signal profiles to identify genomic regions with statistically significant enrichment of mapped reads over background noise.
Modern WeWork hardware lab area with product team collaborating around AI device prototypes, 3D printer in background, dramatic industrial lighting with product sketches on glass walls.
COMPUTATIONAL GENOMICS

What is Peak Calling?

Peak calling is the computational process of analyzing ChIP-seq or ATAC-seq signal profiles to identify genomic regions with statistically significant enrichment of mapped reads over background noise.

Peak calling is the algorithmic identification of discrete genomic loci where the density of aligned sequencing reads is significantly higher than the expected background noise distribution. The process transforms a continuous signal track of mapped fragments into a set of discrete intervals—called peaks—that represent the most likely locations of protein-DNA binding events or regions of open chromatin.

Modern peak callers like MACS2 and HOMER model the shift size between positive and negative strand read densities to estimate fragment length, then apply a Poisson or negative binomial distribution to compute a p-value for each candidate region. The resulting peaks are filtered using a false discovery rate threshold and assessed for reproducibility across biological replicates using the Irreproducible Discovery Rate framework.

SIGNAL DETECTION IN NOISY DATA

Key Characteristics of Peak Calling

Peak calling is the computational process of identifying genomic regions where mapped sequencing reads are statistically enriched over background noise. These algorithms must balance sensitivity and specificity to detect true protein-DNA binding events.

01

Statistical Enrichment Testing

Peak callers model the null distribution of background reads to determine if observed signal exceeds random expectation.

  • Poisson models (MACS2) assume local background rates follow a Poisson distribution
  • Negative binomial models (MACS3) account for overdispersion in count data
  • Zero-truncated distributions handle sparse single-cell ATAC-seq data
  • Hidden Markov Models (HOMER) segment the genome into enriched and background states

The choice of statistical model directly impacts the false discovery rate and the ability to detect weak but reproducible binding events.

02

Fragment Length Estimation

Accurate peak calling requires estimating the average DNA fragment length from the sequencing library to shift reads toward the true binding site.

  • Strand cross-correlation analysis computes the Pearson correlation between positive and negative strand read densities at varying shift distances
  • The phantom peak at the read length indicates PCR artifacts
  • The true peak at the fragment length reveals the predominant insertion size
  • MACS2 uses this estimate to extend single-end reads to predicted fragment length before pileup computation

Poor fragment length estimation leads to split peaks or merged adjacent peaks.

03

Local vs. Global Background

Peak callers differ in how they model the expected background signal, which critically affects sensitivity in regions with variable mappability.

  • Local background (MACS2): Uses a dynamic window (default 1,000–10,000 bp) around each candidate peak to estimate the local noise rate, accounting for copy number variation and chromatin state
  • Global background (early methods): Assumes a uniform genome-wide background rate, which fails in repetitive or amplified regions
  • Input control subtraction: Compares ChIP signal against a matched input DNA control to remove systematic biases from chromatin structure and sequencing

Local background estimation is essential for detecting peaks in heterochromatic regions with low overall signal.

04

Replicate Consistency

Biological replicates are essential for distinguishing reproducible binding events from technical artifacts, and peak callers employ specific frameworks to assess consistency.

  • Irreproducible Discovery Rate (IDR) models the rank correlation of signal strength across replicates
  • IDR produces a thresholded set of peaks that are consistent across experiments
  • Overlap-based approaches (bedtools intersect) require peaks to be present in multiple replicates
  • Joint modeling (JAMM) simultaneously analyzes all replicates to detect condition-specific peaks

IDR has become the ENCODE consortium standard for producing high-confidence peak sets from replicate experiments.

05

Signal Normalization Strategies

Normalization corrects for differences in sequencing depth and library complexity between samples to enable quantitative comparison.

  • Reads Per Million (RPM): Simple depth normalization that scales counts by total mapped reads
  • Normalized Read Count (NRC): Scales to the smaller library size for paired comparisons
  • Quantile normalization: Forces the distribution of signal values to match across samples
  • Spike-in normalization: Uses exogenous chromatin from a different species as an internal reference for absolute quantification

Without proper normalization, differential binding analysis between conditions becomes unreliable due to technical rather than biological variation.

06

Peak Shape Classification

Different types of protein-DNA interactions produce characteristic peak morphologies that inform downstream analysis.

  • Punctate peaks: Sharp, narrow enrichment typical of transcription factor binding at specific motifs (100–300 bp width)
  • Broad domains: Wide regions of enrichment spanning kilobases, characteristic of histone modifications like H3K36me3 and H3K9me3
  • Mixed regions: Some marks like H3K4me3 show both sharp peaks at promoters and broader domains
  • Bimodal peaks: Paired enrichment on both strands flanking a nucleosome-free region, typical of ATAC-seq open chromatin

Peak callers like MACS2 and SICER are specifically designed for punctate or broad peak detection respectively.

ALGORITHM SELECTION GUIDE

Comparison of Peak Calling Algorithms

A feature-level comparison of widely used statistical and machine learning-based peak callers for ChIP-seq and ATAC-seq analysis.

FeatureMACS3HOMERGenrich

Underlying Model

Poisson distribution with local lambda

Binomial/ZINB with local background

Negative binomial with ATAC-specific adjustments

Input Control Support

ATAC-seq Optimized

Broad Peak Mode

Replicate Handling

Pooled analysis with IDR post-processing

Pooled or individual with IDR post-processing

Concatenated alignment recommended

Differential Binding

Via bdgdiff subcommand

Via getDifferentialPeaks

Memory Footprint (Human Genome)

< 4 GB

8-16 GB

< 2 GB

Runtime (50M reads)

< 15 min

30-60 min

< 5 min

PEAK CALLING CLARIFIED

Frequently Asked Questions

Direct answers to the most common technical questions about the computational identification of protein-DNA binding sites from high-throughput sequencing data.

Peak calling is the computational process of analyzing ChIP-seq or ATAC-seq signal profiles to identify genomic regions with statistically significant enrichment of mapped reads over background noise. The workflow begins by aligning millions of short sequencing reads to a reference genome. The aligned reads are then aggregated into a continuous signal profile, often by extending reads to the estimated fragment length. A sliding window scans the genome, and at each position, a statistical test—typically a Poisson or negative binomial model—compares the observed read count to a local or global background estimate. Regions where the signal exceeds a significance threshold (e.g., FDR < 0.01) are called as peaks. Post-processing steps merge adjacent peaks, filter artifacts like blacklisted regions, and assess reproducibility using the Irreproducible Discovery Rate (IDR) framework across biological replicates.

Prasad Kumkar

About the author

Prasad Kumkar

CEO & MD, Inference Systems

Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.

His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.