Compaction of chromatin domains regulates target search times of proteins
PLOS Computational Biology · 20.01.2026 · 22 (1) · e1013843
DOI: 10.1371/journal.pcbi.1013843 ↗Kurz gefasst
Fachartikel in der Zeitschrift PLOS Computational Biology, online erschienen am 20.01.2026. Verfasst von Shuvadip Dutta und 3 weiteren Autor:innen. Beteiligte Einrichtung: Department of Physics, Indian Institute of Technology Bombay, Mumbai, Maharashtra, India. Hauptthemen laut MEDLINE: Chromatin, Proteins. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 86 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: PMRF, MoE, India, Science and Engineering Research Board, India.
Abstract (Originalsprache)
Protein molecules must efficiently locate specific DNA sequences within the densely packed chromatin of the cell nucleus. We investigate how the spatial organisation of chromatin, specifically its organisation into Topologically Associating Domains (TADs), fundamentally affects this search process. Using exact analytical theory and simulations of different models of chromatin, we show that target search within compact, highly connected chromatin domains can leverage intersegmental jumps to significantly decrease search times. Further, we establish that there exists an optimal degree of polymer compaction that minimizes the search time for proteins to find their targets. For highly folded domains, our results suggest that rather than bulk diffusion, intersegmental transfers – jumping between chromatin segments that are close together in space – drive the optimal search process. Remarkably, when we analyse 8,355 TAD structures across the human genome, we find that their natural connectivity matches with the theoretical optimum predicted by our model. The structural organisation within TADs significantly reduces protein search times far beyond what is achievable through classical facilitated diffusion. In essence, our work suggests that packaging of chromatin inside the nucleus has implications beyond spatial organisation, and is also intricately linked to the dynamics of proteins inside the nuclear environment.
Schlagwörter
MeSH-Schlagwörter (MEDLINE)
Substanzen
Autor:innen und Institutionen
- Department of Physics, Indian Institute of Technology Bombay, Mumbai, Maharashtra, India.
- School of Mathematical Sciences, Queensland University of Technology (QUT), Brisbane, Queensland, Australia.
- ARC Centre of Excellence for the Mathematical Analysis of Cellular Systems, QUT, Brisbane, Queensland, Australia.
- Department of Biosciences and Bioengineering, Indian Institute of Technology Bombay, Mumbai, Maharashtra, India.
- Sunita Sanghi Centre of Aging and Neurodegenerative Diseases, Indian Institute of Technology Bombay, Mumbai, Maharashtra, India.
- Koita Centre for Digital Health, Indian Institute of Technology Bombay, Mumbai, Maharashtra, India.
ORCID-Profile: Shuvadip Dutta, Ranjith Padinhateeri, Mithun K Mitra
Förderung
- PMRF, MoE, India
- Science and Engineering Research Board, India
Zitieren
APA
Dutta, S., Rajakumar, A., Padinhateeri, R., & Mitra, M. K. (2026). Compaction of chromatin domains regulates target search times of proteins. PLOS Computational Biology, 22(1), e1013843. https://doi.org/10.1371/journal.pcbi.1013843
Vancouver
Dutta S, Rajakumar A, Padinhateeri R, Mitra MK. Compaction of chromatin domains regulates target search times of proteins. PLOS Computational Biology. 2026;22(1):e1013843. doi:10.1371/journal.pcbi.1013843
BibTeX
@article{Dutta2026,
author = {Dutta, Shuvadip and Rajakumar, Adarshkrishnan and Padinhateeri, Ranjith and Mitra, Mithun K},
title = {Compaction of chromatin domains regulates target search times of proteins},
journal = {PLOS Computational Biology},
year = {2026},
volume = {22},
number = {1},
pages = {e1013843},
doi = {10.1371/journal.pcbi.1013843}
}
EUVIMED