Sequence-to-contact prediction is a deep learning task that maps a one-dimensional DNA sequence directly to a two-dimensional Hi-C contact map, inferring the three-dimensional folding architecture of chromatin in silico. Models such as Akita use convolutional neural networks to learn the complex regulatory grammar—including CTCF binding sites, cohesin loading positions, and epigenomic signals—that governs loop extrusion and topologically associating domain (TAD) formation, outputting predicted interaction frequencies between all genomic locus pairs.
Glossary
Sequence-to-Contact Prediction

What is Sequence-to-Contact Prediction?
Sequence-to-contact prediction is the direct computational inference of genome-wide chromatin interaction frequencies from raw linear DNA sequence using deep learning models, bypassing the need for experimental Hi-C assays.
This approach fundamentally shifts 3D genomics from a purely observational to a predictive discipline. By accurately forecasting enhancer-promoter interactions, A/B compartment segregation, and insulation scores from sequence alone, these models enable the assessment of structural variant impact on genome folding and the generation of synthetic Hi-C data for cell types lacking experimental data. Performance is benchmarked using the stratum-adjusted correlation coefficient (SCC) against experimental Micro-C or DNA FISH validation.
Key Characteristics of Sequence-to-Contact Models
Sequence-to-contact prediction models bypass experimental Hi-C assays by learning the complex mapping from linear DNA sequence to 3D chromatin interaction frequencies. These architectures integrate genomic language models, polymer physics, and multi-scale feature extraction to generate genome-wide contact maps directly from nucleotide data.
End-to-End Differentiable Prediction
These models learn a direct mapping from raw DNA sequence to Hi-C contact matrices without intermediate hand-crafted features. The entire pipeline—from sequence encoding through spatial proximity prediction—is trained jointly via backpropagation.
- Input: One-hot encoded DNA sequence or k-mer tokenized representations spanning megabase-scale loci
- Output: Predicted contact probability matrix at multiple resolutions (e.g., 1 kb, 5 kb, 10 kb bins)
- Loss functions typically combine mean squared error on log-transformed contacts with Stratum-Adjusted Correlation Coefficient (SCC) optimization
- Enables in silico perturbation experiments: mutate a sequence and observe predicted folding changes without wet-lab assays
Multi-Scale Feature Extraction
Chromatin folding is governed by signals operating at vastly different length scales—from individual transcription factor binding motifs (tens of base pairs) to topologically associating domains (hundreds of kilobases). Sequence-to-contact models employ hierarchical architectures to capture this spectrum.
- Convolutional layers with dilated kernels detect local motifs (CTCF, cohesin loading sites)
- Transformer attention heads model long-range dependencies between distal regulatory elements
- U-Net style encoder-decoder structures preserve spatial resolution while expanding receptive fields
- Multi-scale inputs may include epigenomic tracks (chromatin accessibility, histone marks) as auxiliary channels
Polymer Physics Integration
Leading models incorporate biophysical constraints to ensure predictions are physically plausible. Rather than treating chromatin as an arbitrary graph, they respect the polymer nature of DNA.
- Distance-dependent decay priors: Contact probability decreases with genomic distance following power-law relationships observed in real Hi-C data
- Excluded volume constraints: Two loci cannot occupy the same spatial position
- Loop extrusion simulation: Some architectures explicitly model cohesin-mediated extrusion dynamics as a differentiable module
- Polymer physics-informed loss terms penalize structures that violate known folding principles
- This integration dramatically improves generalization to unseen genomic contexts
Genomic Language Model Backbones
Modern sequence-to-contact architectures leverage pre-trained genomic foundation models as feature extractors. These DNA language models, trained on massive genome-wide datasets via self-supervision, encode rich evolutionary and regulatory information.
- Nucleotide transformer and Enformer-style backbones generate contextualized sequence embeddings
- Pre-training tasks include masked nucleotide prediction and next-k-mer prediction across species
- Transfer learning from these backbones dramatically reduces the labeled Hi-C data required for fine-tuning
- Embeddings capture splice sites, promoter architecture, and conserved non-coding elements without explicit annotation
- Enables cross-species generalization: models trained on human data can predict folding in mouse
Allele-Specific and Haplotype-Resolved Prediction
Advanced models predict 3D folding separately for maternal and paternal chromosomes, revealing how genetic variation influences chromatin architecture. This capability is critical for understanding the regulatory impact of heterozygous variants.
- Requires phased genotypes or haplotype-resolved reference genomes as input
- Models learn to distinguish folding patterns driven by single nucleotide polymorphisms (SNPs) in CTCF binding sites
- Enables prediction of allele-specific enhancer-promoter loops that explain imbalanced gene expression
- Critical for interpreting non-coding variants from genome-wide association studies (GWAS)
- Validated against allele-specific Hi-C and DNA FISH experiments
Synthetic Data Generation and Augmentation
Sequence-to-contact models function as generative engines for creating realistic Hi-C maps in silico. This capability addresses the scarcity of experimental 3D genome data across diverse cell types and conditions.
- Generative adversarial networks (GANs) produce high-fidelity contact maps indistinguishable from experimental data
- Variational autoencoders (VAEs) enable latent space interpolation between cell states
- Models can simulate the effects of structural variants (deletions, inversions, translocations) on genome folding
- Synthetic maps augment training datasets for downstream models (e.g., enhancer-promoter link predictors)
- Enables virtual knockout experiments: predict folding changes after removing specific regulatory elements
Enabling Efficiency, Speed & Accuracy
Intelligent Analysis, Decision & Execution
We build AI systems for teams that need search across company data, workflow automation across tools, or AI features inside products and internal software.
Talk to Us
Search across company data
Give teams answers from docs, tickets, runbooks, and product data with sources and permissions.
Useful when people spend too long searching or get different answers from different systems.

Automate internal workflows
Use AI to route work, draft outputs, trigger actions, and keep approvals and logs in place.
Useful when repetitive work moves across multiple tools and teams.

Add AI to products and internal tools
Build assistants, guided actions, or decision support into the software your team or customers already use.
Useful when AI needs to be part of the product, not a separate tool.
Frequently Asked Questions
Clear, technically precise answers to the most common questions about predicting 3D genome folding directly from linear DNA sequence using deep learning.
Sequence-to-contact prediction is the computational task of directly inferring genome-wide chromatin interaction frequencies from raw linear DNA sequence using deep learning models, bypassing the need for experimental Hi-C data. The process works by feeding a one-hot encoded DNA sequence window into a neural network—typically a convolutional neural network (CNN) or transformer—that learns to map sequence motifs to spatial proximity. The model outputs a predicted Hi-C contact map, a two-dimensional matrix where each entry represents the interaction frequency between two genomic loci. Key architectural components include dilated convolutions to capture long-range dependencies, distance-aware attention mechanisms that account for the expected power-law decay of contact probability with genomic distance, and multi-task heads that simultaneously predict chromatin features like CTCF binding and A/B compartments to regularize the folding prediction. The model is trained on paired DNA sequence and experimental Hi-C data, learning the complex cis-regulatory grammar that governs three-dimensional genome organization.
Related Terms
Explore the foundational concepts, model architectures, and validation metrics that underpin the computational prediction of 3D genome folding from linear DNA sequence.
Hi-C Contact Map
A genome-wide matrix quantifying interaction frequencies between all pairs of genomic loci. It serves as both the primary training target and the ground-truth benchmark for sequence-to-contact models. Each entry in the matrix represents the probability that two DNA fragments are physically ligated, reflecting their spatial proximity in the nucleus. Deep learning models are trained to predict these maps directly from DNA sequence, bypassing the need for costly experimental assays.
Stratum-Adjusted Correlation Coefficient (SCC)
A reproducibility metric specifically designed for Hi-C data that measures the similarity between predicted and experimental contact maps. Unlike standard correlation, SCC accounts for the distance-dependent background signal by stratifying contacts by genomic distance. This prevents models from achieving artificially high scores by simply learning the generic decay of contact probability with linear distance, forcing them to capture biologically meaningful loop and domain structures.
Loop Extrusion Model
A mechanistic model of chromatin organization wherein cohesin complexes actively translocate along DNA, extruding progressively larger loops until blocked by CTCF boundary elements. Sequence-to-contact models implicitly learn the sequence determinants of this process, including CTCF motif orientation and cohesin loading sites. Understanding loop extrusion physics informs the architectural priors embedded in polymer physics-informed neural networks for 3D genome reconstruction.
Genomic Distance Normalization
A statistical correction applied to Hi-C contact maps to account for the expected background contact frequency decay as a function of linear genomic distance. The probability of contact between two loci decreases rapidly as their separation increases. Normalization removes this power-law distance dependence, revealing specific interactions like loops and domains. Sequence-to-contact models must learn to predict both the background decay and the deviations that indicate functional structures.
Synthetic Hi-C Generation
The use of generative models, such as GANs or VAEs, to create artificial but realistic Hi-C contact maps. These synthetic maps augment limited training datasets and enable the simulation of genetic perturbation effects on genome folding. By generating contact maps for hypothetical sequence variants, researchers can predict how mutations might disrupt normal chromatin architecture without performing experiments, accelerating the functional interpretation of non-coding variants.

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.
Partnered with leading AI, data, and software stack.
How We Work
Custom AI workflows for your Business
One-fit-all AI don't work for modern businesses. At Inferensys, we aim to understand your business & custom requirements; which we use to define most efficient agentic workflows, the data, and the tools for your business.
01
Review the use case
We understand the task, the users, and where AI can actually help.
Read more02
Pick the right approach
We define what needs search, automation, or product integration.
Read more03
Build the first useful version
We implement the part that proves the value first.
Read more04
Improve from there
We add the checks and visibility needed to keep it useful.
Read moreThe first call is a practical review of your use case and the right next step.
Talk to Us