Topological Spectra and Entropy of Chromatin Loop Networks.

The 3D folding of a mammalian gene can be studied by a polymer model, where the chromatin fiber is represented by a semiflexible polymer which interacts with multivalent proteins, representing complexes of DNA-binding transcription factors and RNA polymerases. This physical model leads to the natural emergence of clusters of proteins and binding sites, accompanied by the folding of chromatin into a set of topologies, each associated with a different network of loops. Here, we combine numerics and analytics to first classify these networks and then find their relative importance or statistical weight, when the properties of the underlying polymer are those relevant to chromatin. Unlike polymer networks previously studied, our chromatin networks have finite average distances between successive binding sites, and this leads to giant differences between the weights of topologies with the same number of edges and nodes but different wiring. These weights strongly favor rosettelike structures with a local cloud of loops with respect to more complicated nonlocal topologies. Our results suggest that genes should overwhelmingly fold into a small fraction of all possible 3D topologies, which can be robustly characterized by the framework we propose here.

Combinatorics and topological weights of chromatin loop networks.

Polymer physics models suggest that chromatin spontaneously folds into loop networks with transcription units (TUs), such as enhancers and promoters, as anchors. Here we use combinatoric arguments to enumerate the emergent chromatin loop networks, both in the case where TUs are labeled and where they are unlabeled. We then combine these mathematical results with those of computer simulations aimed at finding the inter-TU energy required to form a target loop network. We show that different topologies are vastly different in terms of both their combinatorial weight and energy of formation. We explain the latter result qualitatively by computing the topological weight of a given network-i.e., its partition function in statistical mechanics language-in the approximation where excluded volume interactions are neglected. Our results show that networks featuring local loops are statistically more likely with respect to networks including more nonlocal contacts. We suggest our classification of loop networks, together with our estimate of the combinatorial and topological weight of each network, will be relevant to catalog three-dimensional structures of chromatin fibers around eukaryotic genes, and to estimate their relative frequency in both simulations and experiments.