Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFirst-passage processes on a filamentous track in a dense traffic: optimizing diffusive search for a target in crowding conditions
79
0
0.0
(
0
)
Added by
Debashish Chowdhury
Publication date
2018
fields
Physics
and research's language is
English
Authors
Soumendu Ghosh
Ask ChatGPT about the research
No Arabic abstract
Several important biological processes are initiated by the binding of a protein to a specific site on the DNA. The strategy adopted by a protein, called transcription factor (TF), for searching its specific binding site on the DNA has been investigated over several decades. In recent times the effects obstacles, like DNA-binding proteins, on the search by TF has begun to receive attention. RNA polymerase (RNAP) motors collectively move along a segment of the DNA during a genomic process called transcription. This RNAP traffic is bound to affect the diffusive scanning of the same segment of the DNA by a TF searching for its binding site. Motivated by this phenomenon, here we develop a kinetic model where a `particle, that represents a TF, searches for a specific site on a one-dimensional lattice. On the same lattice another species of particles, each representing a RNAP, hop from left to right exactly as in a totally asymmetric simple exclusion process (TASEP) which forbids simultaneous occupation of any site by more than one particle, irrespective of their identities. Although the TF is allowed to attach to or detach from any lattice site, the RNAPs can attach only to the first site at the left edge and detach from only the last site on the right edge of the lattice. We formulate the search as a {it first-passage} process; the time taken to reach the target site {it for the first time}, starting from a well defined initial state, is the search time. By approximate analytical calculations and Monte Carlo (MC) computer simulations, we calculate the mean search time. We show that RNAP traffic rectifies the diffusive motion of TF to that of a Brownian ratchet, and the mean time of successful search can be even shorter than that required in the absence of RNAP traffic. Moreover, we show that there is an optimal rate of detachment that corresponds to the shortest mean search time.
rate research
Read More
Nuclear pore complexes are constantly confronted by large fluxes of macromolecules and macromolecular complexes that need to get into and out of the nucleus. Such bi-directional traffic occurring in a narrow channel can easily lead to jamming. How then is passage between the nucleus and cytoplasm maintained under the varying conditions that arise during the lifetime of the cell? Here, we address this question using computer simulations in which the behaviour of the ensemble of transporting cargoes is analyzed under different conditions. We suggest that traffic can exist in two distinct modes, depending on concentration of cargoes and dissociation rates of the transport receptor-cargo complexes from the pores. In one mode, which prevails when dissociation is quick and cargo concentration is low, transport in either direction proceeds uninterrupted by the other direction. The result is that overall-traffic-direction fluctuates rapidly and unsystematically between import and export. Remarkably, when cargo concentrations are high and dissociation is slow, another mode takes over in which traffic proceeds in one direction for a certain extent of time, after which it flips direction for another period. The switch between this, more regulated, mode of transport and the other, quickly fluctuating state, does not require an active gating mechanism but rather occurs spontaneously through the dynamics of the transported particles themselves. The determining factor for the behaviour of traffic is found to be the exit rate from the pore channel, which is directly related to the activity of the Ran system that controls the loading and release of cargo in the appropriate cellular compartment.
The problem of the time required for a diffusing molecule, within a large bounded domain, to first locate a small target is prevalent in biological modeling. Here we study this problem for a small spherical target. We develop uniform in time asymptotic expansions in the target radius of the solution to the corresponding diffusion equation. Our approach is based on combining short-time expansions using pseudo-potential approximations with long-time expansions based on first eigenvalue and eigenfunction approximations. These expansions allow the calculation of corresponding expansions of the first passage time density for the diffusing molecule to find the target. We demonstrate the accuracy of our method in approximating the first passage time density and related statistics for the spherically symmetric problem where the domain is a large concentric sphere about a small target centered at the origin.
A swarm of preys when attacked by a predator is known to rely on their cooperative interactions to escape. Understanding such interactions of collectively moving preys and the emerging patterns of their escape trajectories still remain elusive. In this paper, we investigate how the range of cooperative interactions within a prey group affects the survival chances of the group while chased by a predator. As observed in nature, the interaction range of preys may vary due to their vision, age, or even physical structure. Based on a simple theoretical prey-predator model, here, we show that an optimality criterion for the survival can be established on the interaction range of preys. Very short range or long range interactions are shown to be inefficient for the escape mechanism. Interestingly, for an intermediate range of interaction, survival probability of the prey group is found to be maximum. Our analysis also shows that the nature of the escape trajectories strongly depends on the range of interactions between preys and corroborates with the naturally observed escape patterns. Moreover, we find that the optimal survival regime depends on the prey group size and also on the predator strength.
We study a simple swarming model on a two-dimensional lattice where the self-propelled particles exhibit a tendency to align ferromagnetically. Volume exclusion effects are present: particles can only hop to a neighboring node if the node is empty. Here we show that such effects lead to a surprisingly rich variety of self-organized spatial patterns. As particles exhibit an increasingly higher tendency to align to neighbors, they first self-segregate into disordered particle aggregates. Aggregates turn into traffic jams. Traffic jams evolve toward gliders, triangular high density regions that migrate in a well-defined direction. Maximum order is achieved by the formation of elongated high density regions - bands - that transverse the entire system. Numerical evidence suggests that below the percolation density the phase transition associated to orientational order is of first-order, while at full occupancy it is of second-order. The model highlights the (pattern formation) importance of a coupling between local density, orientation, and local speed.
We consider a one-dimensional, weakly asymmetric, boundary driven exclusion process on the interval $[0,N]cap Z$ in the super-diffusive time scale $N^2 epsilon^{-1}_N$, where $1ll epsilon^{-1}_N ll N^{1/4}$. We assume that the external field and the chemical potentials, which fix the density at the boundaries, evolve smoothly in the macroscopic time scale. We derive an equation which describes the evolution of the density up to the order $epsilon_N$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
