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.

Articles by others on the same topic (0)

There are currently no matching articles.