Skip to content
naulon
Not checkedNot checked for notices yet.

Kinesin-1, -2, and -3 motors use family-specific mechanochemical strategies to effectively compete with dynein during bidirectional transport

Allison M Gicking, Tzu-Chen Ma, Qingzhou Feng and 4 more

eLife · 2022

doi:10.7554/elife.82228 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Bidirectional cargo transport in neurons requires competing activity of motors from the kinesin-1, -2, and -3 superfamilies against cytoplasmic dynein-1. Previous studies demonstrated that when kinesin-1 attached to dynein-dynactin-BicD2 (DDB) complex, the tethered motors move slowly with a slight plus-end bias, suggesting kinesin-1 overpowers DDB but DDB generates a substantial hindering load. Compared to kinesin-1, motors from the kinesin-2 and -3 families display a higher sensitivity to load in single-molecule assays and are thus predicted to be overpowered by dynein complexes in cargo transport. To test this prediction, we used a DNA scaffold to pair DDB with members of the kinesin-1, -2, and -3 families to recreate bidirectional transport in vitro, and tracked the motor pairs using two-channel TIRF microscopy. Unexpectedly, we find that when both kinesin and dynein are engaged and stepping on the microtubule, kinesin-1, -2, and -3 motors are able to effectively withstand hindering loads generated by DDB. Stochastic stepping simulations reveal that kinesin-2 and -3 motors compensate for their faster detachment rates under load with faster reattachment kinetics. The similar performance between the three kinesin transport families highlights how motor kinetics play critical roles in balancing forces between kinesin and dynein, and emphasizes the importance of motor regulation by cargo adaptors, regulatory proteins, and the microtubule track for tuning the speed and directionality of cargo transport in cells.

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.