Inferensys

Glossary

3D Genome Folding

The computational prediction of the three-dimensional spatial organization of chromatin inside the nucleus from DNA sequence, where transformer models learn to predict Hi-C contact maps and identify topologically associating domains.
MLOps engineer reviewing model serving infrastructure on laptop, container orchestration visible, technical workspace.
CHROMATIN CONFORMATION

What is 3D Genome Folding?

3D genome folding is the computational prediction of the three-dimensional spatial organization of chromatin inside the nucleus directly from DNA sequence data.

3D genome folding refers to the computational task of predicting how a linear DNA molecule is spatially organized into complex, hierarchical structures within the three-dimensional volume of the cell nucleus. This process involves modeling the formation of chromatin loops, topologically associating domains (TADs) , and larger A/B compartments that bring distal regulatory elements, such as enhancers, into physical proximity with their target gene promoters.

Transformer-based models address this challenge by learning to predict Hi-C contact maps—matrices that quantify the frequency of physical interactions between any two genomic loci—directly from the underlying DNA sequence. By applying self-attention mechanisms to capture long-range dependencies, these models infer the intricate folding rules that govern genome architecture, enabling the identification of structural features critical for gene regulation.

ARCHITECTURAL PRINCIPLES

Core Characteristics of 3D Genome Folding Models

Transformer-based models for 3D genome folding learn to predict the spatial proximity of distal genomic loci directly from DNA sequence, capturing the complex grammar of chromatin architecture.

01

Hi-C Contact Map Prediction

The primary supervised task where models predict the contact frequency matrix between pairs of genomic loci from DNA sequence alone. A Hi-C map is a square matrix where entry (i, j) represents the frequency of physical interaction between locus i and locus j.

  • Input: One-hot encoded DNA sequence, often 1–2 megabases in length
  • Output: A predicted contact probability map at a specific resolution (e.g., 5–10 kb bins)
  • Loss function: Often Poisson or mean squared error loss, comparing predicted contacts to experimental Hi-C data
  • Key challenge: The output matrix is sparse and high-dimensional, requiring specialized architectures to handle the quadratic scaling of genomic distance
1Mb+
Typical Input Sequence Length
5–10 kb
Standard Map Resolution
02

Topologically Associating Domain (TAD) Identification

A critical downstream analysis where models identify self-interacting genomic regions that are insulated from neighboring domains. TADs are fundamental structural units of chromosome folding, typically spanning hundreds of kilobases.

  • Mechanism: Models learn to detect the boundaries where contact frequency sharply drops, often marked by CTCF binding sites in convergent orientation
  • Insulation score: A quantitative metric computed from the predicted contact map, measuring the degree of boundary strength at each genomic bin
  • Biological significance: TAD boundaries constrain enhancer-promoter interactions, and their disruption is linked to developmental disorders and oncogene activation
  • Model output: A one-dimensional track of boundary probabilities across the entire input sequence
100s kb
Average TAD Size
CTCF
Key Boundary Protein
03

Long-Range Dependency Modeling

The central architectural challenge that distinguishes 3D genome folding models from standard genomic classifiers. Enhancers can regulate genes located megabases away in linear sequence, requiring models to capture dependencies across vast genomic distances.

  • Dilated attention: Sparse attention patterns that skip intervening bins to directly connect distal elements
  • Hierarchical architectures: Multi-scale models that process the sequence at multiple resolutions simultaneously, merging local motif detection with global chromatin domain awareness
  • Relative positional encoding: Methods like Rotary Position Embedding (RoPE) that naturally encode the distance between two loci, helping the model learn distance-dependent contact decay
  • State Space Models: Linear-complexity alternatives like Mamba that can process entire chromosomes without the quadratic memory cost of full attention
1Mb+
Maximum Enhancer-Promoter Distance
O(n)
SSM Complexity Target
04

DNA Sequence-to-Structure Grammar

The learned mapping from primary nucleotide sequence to three-dimensional folding patterns. Models implicitly capture the cis-regulatory code that governs chromatin architecture without explicit feature engineering.

  • Motif grammar: Attention heads learn to recognize binding motifs for architectural proteins like CTCF, cohesin, and YY1
  • Orientation sensitivity: Models distinguish between convergent, tandem, and divergent CTCF motif pairs, which is essential for loop extrusion directionality
  • Epigenetic integration: Advanced models incorporate DNase-seq or ChIP-seq tracks as additional input channels, learning the interplay between chromatin state and 3D structure
  • Transfer learning: Pre-trained genomic language models like Enformer or Nucleotide Transformer provide rich embeddings that encode this grammar, which can be fine-tuned for folding prediction
CTCF
Master Architectural Protein
Convergent
Loop-Extrusion Orientation Rule
05

Loop Extrusion Simulation

A mechanistic modeling approach where transformers learn to emulate the cohesin-mediated loop extrusion process that shapes interphase chromatin. Rather than predicting static contacts, these models capture the dynamic process.

  • Extrusion factors: Cohesin complexes load onto chromatin and extrude DNA bidirectionally until blocked by convergently oriented CTCF proteins
  • Model integration: Some architectures combine a transformer for sequence feature extraction with a differentiable loop extrusion simulator for physically grounded contact map generation
  • Dynamic prediction: Models can predict how contact maps change upon cohesin depletion or CTCF site deletion, enabling in-silico perturbation experiments
  • Validation: Predicted extrusion dynamics are validated against Hi-C data from cohesin degradation time-course experiments
Cohesin
Primary Extrusion Motor
~1 kb/s
Estimated Extrusion Rate
06

Cross-Cell-Type Generalization

The ability of a 3D genome folding model trained on one cell type to accurately predict chromatin architecture in an unseen cell type, a critical test of whether the model has learned universal folding principles.

  • Invariant features: Models learn that CTCF binding and cohesin loading are primary determinants of structure across cell types, while cell-type-specific transcription factor binding modulates local interactions
  • Fine-tuning strategy: Pre-training on a large compendium of Hi-C data from diverse cell types, then fine-tuning on a specific lineage with limited data
  • Evaluation metric: Genome-wide correlation between predicted and experimental contact maps in held-out cell types, often measured by Hi-C reproducibility metrics like HiCRep or Stratum-adjusted Correlation Coefficient (SCC)
  • Failure modes: Models struggle with cell types undergoing large-scale genome reorganization, such as mitotic chromosome condensation or meiotic pairing
HiCRep
Key Reproducibility Metric
Dozens
Cell Types in Training Compendia
3D GENOME FOLDING

Frequently Asked Questions

Clear, technically precise answers to common questions about the computational prediction of chromatin architecture using deep learning.

3D genome folding refers to the spatial organization of chromatin—the complex of DNA and proteins—inside the cell nucleus. This three-dimensional architecture brings linearly distant regulatory elements, such as enhancers, into physical proximity with their target gene promoters, directly controlling gene expression. It is computationally predicted because experimental determination of the 3D structure for every cell type and condition via Hi-C or Micro-C assays remains prohibitively expensive and low-throughput. Deep learning models, particularly transformer architectures, learn to infer this folding pattern directly from DNA sequence and epigenetic features, enabling genome-wide structural annotation at scale. Accurate prediction is critical for understanding the non-coding regulatory code and for interpreting the mechanistic impact of disease-associated genetic variants that fall outside protein-coding regions.

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.