RNA polymerase first recognizes and binds a gene promoter to form a closed complex with the local DNA duplex still paired. Local strand separation then produces a transcription bubble in an open promoter complex, making the template available for RNA synthesis. Recognition, binding, and opening are distinct events; observing binding alone does not demonstrate strand opening.
In magnetic tweezers, a DNA tether joins a fixed surface to a magnetic bead, with attachments that prevent free swivelling. The magnets pull upward and can impose turns; the bead height reports tether extension. For a torsionally constrained tether, linking number is partitioned into twist and writhe, . If opening the transcription bubble removes helical twist while is fixed, compensating twist or writhe appears elsewhere. In a supercoiled regime, changes in writhe change the extension, making an opening event visible as a bead-height step.
The sign provides an important control. On a positively supercoiled tether, local unwinding requires more positive compensating writhe and generally shortens the tether. On a negatively supercoiled tether, the same unwinding removes some negative writhe and generally lengthens it. A bending or compaction contribution can have the same sign in both cases, whereas the torsional contribution reverses. Comparing signs, together with an extension-versus-turns response measured for the tether, distinguishes local unwinding from mere binding-induced bending. These claims assume the tether remains torsionally constrained and lies in the calibrated supercoiled regime, rather than an arbitrary stretched-DNA regime.
The given facilitated target search time contains a rising term and a falling term . Longer sliding explores more neighbouring DNA without another bulk encounter, reducing the cost of three-dimensional relocation; but it also spends longer revisiting local contour. Roughly local scans, each taking time of order , give the first term. The second represents the bulk encounter cost for an effective capturable contour range of order , with a Smoluchowski association rate scaling as . Numerical geometrical factors are already absorbed in the stipulated scaling formula.
Differentiating at fixed positive gives
The second derivative proves the minimum is unique. The two contributions are equal there. The formal curve diverges at both zero and infinite ; real sliding lengths are bounded, for example by the available contour, so an inaccessible optimum must be replaced by the nearest physical boundary. In dimensionless form, with . The right panel of the original illustration shows its minimum and the two contributing terms. The supplied expression does not include a factor of 6000; it should not silently be identified with the preceding earliest-encounter estimate.
A skeletal-muscle fibre contains parallel myofibrils assembled from repeating sarcomeres between Z discs. Thin actin filaments extend from the Z discs; bipolar thick myosin II filaments occupy the central region. Overlap between them allows many myosin heads to interact with actin in parallel.
A rise in cytosolic calcium exposes actin binding sites through the troponin–tropomyosin regulatory system. ATP binding releases a strongly attached myosin head; hydrolysis primes its lever arm, attachment and product release permit a force-generating stroke, and another ATP allows detachment. The cycle converts chemical free energy into mechanical work rather than consuming actin or shortening the filaments themselves.
Relative filament sliding draws the Z discs together. The I band and H zone shorten as overlap increases, whereas the thick-filament A-band length is approximately unchanged. Calcium removal restores inhibition and permits relaxation. The many-head ensemble sustains force even though individual cross-bridges repeatedly attach and detach. This sliding-filament description concerns myosin II in muscle; the processive two-head walking of Myosin V in a is a related but distinct motor arrangement.
In spatially gated myosin attachment, for a freshly available head encountering an isolated site, take before the attachment window. Converting time derivatives to position derivatives with gives in the binding window, in the protected bound region, and after detachment becomes allowed. Continuity gives
For , the plateau exceeds and approaches one for much slower motion. For , the binding probability is lower, becoming at very high speed. The spatial detachment tail has length , so faster sliding makes a longer low-probability tail. The following is an original calculation of those profiles; the force panel is derived in c.
Figure 1.
Spatial attachment probability and force in the prescribed-velocity myosin model
. Original profiles compare velocities below and above the binding-window crossing-rate scale. Binding rises only inside the narrow window, remains constant up to the detachment threshold, and then decays. The second panel shows the resulting signed mean force in the narrow-window approximation. Details.
Reset condition. Geometric separation does not alone guarantee detachment before the next site: independently available encounters also need . Without that extra timescale separation the head may still be attached to an earlier site.
For completeness, the periodic steady-state correction can be written explicitly. Put , , and
Here is the probability of entering the new window still attached to an earlier site. In the window the new-site probability is ; after it, use its value in the plateau and tail above. For , replace by . This follows from the old-site probability and new attachment rate . The isolated-site result is recovered as .
For the work of a spatially gated myosin head, the mechanical force exerted by an attached head in the increasing- direction is . It assists motion before and resists it afterwards. For one site encounter the expected work is
In the narrow binding-window limit, retain the capture probability but neglect the attachment displacement compared with . The positive work is . After , use to obtain the negative contribution . Hence
An independent energy calculation gives the same factor: binding near zero loads energy , while an exponentially distributed post-threshold attachment time has , leaving mean elastic energy to be lost upon detachment. The factor of two in that second moment is essential.
One site passes every distance , so average work per distance, or power divided by , gives
The force tends to as and changes sign at in this idealized model. Above that speed forced sliding is resisted on average. The formula uses the reset condition in b, as well as ; if reset fails, replace by the periodic capture probability to leading order in . For arbitrary window width, the isolated-site work is exactly . The loaded spring energy must be supplied by the binding/power-stroke chemistry; this model does not specify an ATP efficiency. Real force-dependent transition rates and energy budgets limit extrapolation of the toy force-velocity law.
Model the target as a perfectly absorbing sphere of reaction radius , with a fixed target and a dilute far-field polymerase density . Steady radial diffusion satisfies , , , hence
Therefore, for a rate law multiplying number densities,
For the earliest diffusive target encounter among independent searchers, with independent well-mixed searchers in volume , the approximate first-arrival rate is , giving . The target's effective reaction radius includes encounter geometry and is not uniquely determined by its contour length.
A numerical estimate needs temperature, cell volume and a capture-geometry convention, none of which is fixed numerically in the source. State representative estimates and . The Stokes–Einstein estimate for a sphere of radius in the stipulated viscosity is
Using the target contour scale as an order-of-magnitude gives and
This is an idealized -second-scale estimate, not a unique geometric prediction. Finite cell shape, crowded motion, accessibility and orientational restrictions can reduce the ideal capture rate.
If nonspecific binding merely sequesters searchers and their free fraction is , the three-dimensional capture hazard is reduced fivefold: for those estimates. If bound molecules instead search productively by sliding, a free-time fraction alone cannot determine the total arrival time or its sign of change. That is the distinct facilitated-search mechanism treated in c.
Write and . The given mean-search scaling is . Three-dimensional relocation sees an effective capture length of order , giving a bulk encounter time . A sliding excursion explores length of order in time of order ; sampling order contour segments gives a total sliding cost of order . Prefactors, correlations and repeated visits are coarse-grained in this scaling model.
Small sliding lengths make relocation inefficient; very long sliding wastes time revisiting a local DNA region rather than relocating to another. The optimum balances both contributions:
Since , it is the unique minimum for unrestricted positive . At the optimum, bulk and sliding times are equal. With ,
Figure 1.
Bulk relocation and local sliding impose opposing search-time costs
. The original dimensionless plot shows a decreasing inverse-sliding-length contribution and an increasing sliding contribution. Their sum has a minimum where the two costs agree, at a sliding length equal to the analytic optimum. Details.
The model is meaningful only over an accessible range between molecular steps and the available chromosome length. An optimum outside that range is replaced by a boundary choice; the unphysical divergences at arbitrarily small or large describe limits of the scaling expression. A common multiplicative searcher-number factor would not change the optimum, but an exact many-searcher first-arrival mean is not generally obtained by dividing an arbitrary single-searcher mean by their number without a waiting-time assumption.
A conceptual single-molecule measurement follows a labelled bound molecule along an independently mapped DNA contour. Project fitted positions onto contour distance and estimate the mean-squared displacement at several lag times. For unbiased one-dimensional diffusion,
Independent localization errors of variance add an intercept . Finite exposure adds motion blur, and drift, binding transitions and the finite DNA contour must be distinguished from free sliding. A slope fit with those limitations can estimate ; simply fitting all observed displacements to a noiseless line can bias it.
Retain the printed coefficient. The original PDF really prints , not a negative exponent. In sliding diffusivity with per-step dissociation, for a basepair step , an unbiased nearest-neighbour walk has step interval . If the dissociation probability per step is , the mean number of steps is approximately , giving
For the printed values, and . The latter is a random-walk displacement, not the contour distance travelled in a million steps. The step interval is about , even shorter than the light-travel time across a basepair by many orders of magnitude. This is an unphysical extrapolation for a protein, not a meaningful experimentally measurable diffusivity.
Consequently no fluorescence camera could temporally resolve trajectories under the stated formal values, regardless of the spatial excursion's length. An actual corrected exponent cannot be inferred uniquely from the paper. If a physically plausible were supplied instead, resolving sliding would require exposures substantially shorter than and diffusion displacements larger than localization error, with enough detected photons. The dependence on is explicit above, so no guessed source correction is needed.
The term is the bulk-diffusion search cost: increasing the effective length of DNA searched after each encounter enlarges the useful capture region and reduces this contribution. The term is the accumulated sliding cost. Approximately DNA landing-and-sliding episodes, each taking order , give . These are scaling estimates; geometric constants and correlated revisits are omitted by the supplied model.
Thus the facilitated target search is slow as , because too little sequence is examined per encounter, and slow at very large , because sliding and repeated local exploration take too long. A finite intermediate minimum balances 1D scanning against 3D relocation. The right panel of the figure in solution shows the two contributions and their sum. The model requires a useful range of sliding lengths below the full chromosome length, finite positive diffusion coefficients and effective relocation between episodes; it is not a claim that arbitrarily large is physically available.