Searching for targets on a model DNA: Effects of inter-segment hopping, detachment and re-attachment

For most of the important processes in DNA metabolism, a protein has to reach a specific binding site on the DNA. The specific binding site may consist of just a few base pairs while the DNA is usually several millions of base pairs long. How does the protein search for the target site? What is the most efficient mechanism for a successful search? Motivated by these fundamental questions on intracellular biological processes, we have developed a model for searching a specific site on a model DNA by a single protein. We have made a comparative quantitative study of the efficiencies of sliding, inter-segmental hoppings and detachment/re-attachments of the particle during its search for the specific site on the DNA. We also introduce some new quantitative measures of {\it efficiency} of a search process by defining a relevant quantity, which can be measured in {\it in-vitro} experiments.

💡 Research Summary

The paper addresses a fundamental problem in molecular biology: how a single protein locates a specific binding site on a very long DNA molecule. The authors construct a stochastic model that incorporates three distinct modes of motion—one‑dimensional sliding along the DNA contour, inter‑segmental hopping that bridges distant DNA segments when the polymer is coiled, and complete detachment followed by three‑dimensional diffusion and re‑attachment. Each mode is characterized by a small set of kinetic parameters: the one‑dimensional diffusion coefficient D₁ and the detachment rate k_off for sliding, the three‑dimensional diffusion coefficient D₃ and the association rate k_on for detachment/reattachment, and the hopping probability p_hop together with the average hop distance ℓ_hop for inter‑segmental jumps.

Using a master‑equation framework, the authors derive analytical expressions for the probability fluxes and, most importantly, for the mean first‑passage time (MFPT) ⟨T⟩ to the target site. They introduce a novel efficiency metric η = (L/⟨T⟩)·(k_on/k_off), where L is the total DNA length. This metric combines the speed of search (inverse MFPT) with the propensity of the protein to re‑bind after detachment, making it directly measurable in in‑vitro experiments that monitor binding kinetics.

Monte‑Carlo simulations explore a wide parameter space. The results show that pure sliding is inefficient for DNA lengths typical of bacterial chromosomes (millions of base pairs) because the sliding length λ = √(D₁/k_off) is much shorter than L, leading to large MFPT values. Introducing a moderate detachment rate dramatically reduces MFPT: the protein can escape from local traps and sample distant regions via 3D diffusion. The optimal k_off balances the time spent sliding against the time lost during detachment, and it depends on the ratio D₁/D₃.

Inter‑segmental hopping becomes advantageous when the DNA is highly compacted. Even a hopping probability as low as 10⁻³, combined with a hop distance comparable to the polymer’s persistence length, cuts the MFPT by more than 30 %. Hopping therefore acts as a bridge between the slow, local sliding and the fast but spatially random 3D diffusion, providing a synergistic search strategy.

The efficiency metric η cleanly separates the contributions of each mode. By varying k_on/k_off experimentally (e.g., by changing ionic strength or protein concentration), one can tune η and identify the regime where the combination of sliding, hopping, and detachment yields the fastest search. The authors argue that in vivo proteins likely exploit this dynamic switching: they slide over short stretches, hop when the DNA is looped or supercoiled, and detach to perform long‑range jumps when necessary.

Finally, the paper discusses experimental implications. The proposed η can be extracted from single‑molecule fluorescence assays that record the dwell time distribution of proteins on stretched or relaxed DNA. The model also predicts how changes in DNA topology (e.g., during transcription or replication) should affect search times, offering testable hypotheses for future work. In summary, the study provides a comprehensive quantitative framework for comparing DNA‑search mechanisms, introduces a practical efficiency measure, and highlights the conditions under which each transport mode is most beneficial.