z-logo
open-access-imgOpen Access
A change point analysis protocol for comparing intracellular transport by different molecular motor combinations
Author(s) -
Melanie A. Jensen,
Qingzhou Feng,
William O. Hancock,
Scott A. McKinley
Publication year - 2021
Publication title -
mathematical biosciences and engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.451
H-Index - 45
eISSN - 1551-0018
pISSN - 1547-1063
DOI - 10.3934/mbe.2021442
Subject(s) - dynein , molecular motor , extrapolation , tug of war , microtubule , population , intracellular transport , kinesin , computer science , protocol (science) , biological system , physics , biology , intracellular , biophysics , mathematics , statistics , genetics , medicine , demography , alternative medicine , pathology , astronomy , sociology
Intracellular transport by microtubule-based molecular motors is marked by qualitatively different behaviors. It is a long-standing and still-open challenge to accurately quantify the various individual-cargo behaviors and how they are affected by the presence or absence of particular motor families. In this work we introduce a protocol for analyzing change points in cargo trajectories that can be faithfully projected along the length of a (mostly) straight microtubule. Our protocol consists of automated identification of velocity change points, estimation of velocities during the behavior segments, and extrapolation to motor-specific velocity distributions. Using simulated data we show that our method compares favorably with existing methods. We then apply the technique to data sets in which quantum dots are transported by Kinesin-1, by Dynein-Dynactin-BicD2 (DDB), and by Kinesin-1/DDB pairs. In the end, we identify pausing behavior that is consistent with some tug-of-war model predictions, but also demonstrate that the simultaneous presence of antagonistic motors can lead to long processive runs that could contribute favorably to population-wide transport.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here