![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > CANCELLED: Modeling chromatin organization and interaction
![]() CANCELLED: Modeling chromatin organization and interactionAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact nobody. This talk has been canceled/deleted Phase separated domains (PSDs) are ubiquitous in cell biology, representing nanoregions of high molecular concentration. PSDs appear at diverse cellular domains, such as neuronal synapses but also in eukaryotic cell nucleus, limiting the access of transcription factors and thus preventing gene expression. We will present here some properties of PSDs derived from polymer models. Increasing the number of cross-linkers generate a polymer condensation, preventing the access of diffusing molecules. To investigate how the PSDs restrict the motion of diffusing molecules, we estimate the mean residence and first escaping times. Finally, by computing the mean square displacement of single particle trajectories, we can reconstruct the properties of PSDs in term of a continuum range of anomalous exponents. To conclude, PSDs can result from a condensed chromatin, where the number of cross-linkers control the molecular access. This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:This talk is not included in any other list Note that ex-directory lists are not shown. |
Other listsNeuroscience Seminars History and Economics SeminarOther talksNon-reciprocal Multifarious Self-organization Participatory development of a drinking water testing system Keynote lecture: Capillary bulldozing and viscously stable frictional fingers Time-series Machine Learning Models for Healthcare: Advancements and Applications Memory may hide dissipation in active baths The hard sphere model, sphere packings, and algorithms |