The search result changed since you submitted your search request. Documents might be displayed in a different sort order.
  • search hit 7 of 16
Back to Result List

Generalized facilitated diffusion model for DNA-binding proteins with search and recognition states

  • Transcription factors (TFs) such as the lac repressor find their target sequence on DNA at remarkably high rates. In the established Berg-von Hippel model for this search process, the TF alternates between three-dimensional diffusion in the bulk solution and one-dimensional sliding along the DNA chain. To overcome the so-called speed-stability paradox, in similar models the TF was considered as being present in two conformations (search state and recognition state) between which it switches stochastically. Combining both the facilitated diffusion model and alternating states, we obtain a generalized model. We explicitly treat bulk excursions for rodlike chains arranged in parallel and consider a simplified model for coiled DNA. Compared to previously considered facilitated diffusion models, corresponding to limiting cases of our generalized model, we surprisingly find a reduced target search rate. Moreover, at optimal conditions there is no longer an equipartition between the time spent by the protein on and off the DNA chain.

Export metadata

Additional Services

Search Google Scholar Statistics
Metadaten
Author details:Maximilian Bauer, Ralf MetzlerORCiDGND
DOI:https://doi.org/10.1016/j.bpj.2012.04.008
ISSN:0006-3495
Title of parent work (English):Biophysical journal
Publisher:Cell Press
Place of publishing:Cambridge
Publication type:Article
Language:English
Year of first publication:2012
Publication year:2012
Release date:2017/03/26
Volume:102
Issue:10
Number of pages:10
First page:2321
Last Page:2330
Funding institution:Academy of Finland
Organizational units:Mathematisch-Naturwissenschaftliche Fakultät / Institut für Physik und Astronomie
Peer review:Referiert
Accept ✔
This website uses technically necessary session cookies. By continuing to use the website, you agree to this. You can find our privacy policy here.