Trajectory Analysis Sample Clauses

Trajectory Analysis. If the FRET efficiency time traces display temporal fluctuations, the data can be further analyzed to obtain more detailed information on the kinetics of the system using dwell-time analysis or hidden Markov modeling, depending on the type of fluctuation as described below. Regardless of the method of trajectory analysis, only molecules exhibiting single-step photobleaching are analyzed, as this is a unique signature of a FRET interaction between a single donor and single acceptor molecule (Figure 2.7C). i. Dwell-time analysis ii. Hidden Markov Modeling Excited States (1) hv (2) hv (3) (1) Excitation of a fluorophore occurs through the absorption of light energy. (2) During the transient excited state lifetime, there is some loss of energy as the fluorophore relaxes to the lowest excited state. (3) Return of a fluorophore to its ground state accompanied by the emission of light. The light energy is always of a longer wavelength than the light energy absorbed (the fluorescence emission is shifted towards the red end of the visible spectrum) due to the energy lost during the transient excited state lifetime. Excitation Maxima Emission Maxima Generalized representation of the absorbance and emission spectra of a fluorophore. hv1 (A) A donor fluorophore is directly excited by a light source (green line, hv), causing it to transition to an excited state. After relaxation, the fluorophore can either return to the ground state by emitting a photon (hv1) or nonradiatively transfer energy to a nearby acceptor fluorophore. The nonradiative energy causes the acceptor fluorophore to reach an excited state, and after relaxation during the excited state lifetime, the fluorophore emits a photon (hv2), allowing it to return to its ground state. (B) FRET efficiency is plotted as a function of distance R between the donor and acceptor (blue line). When the distance between the fluorophores attached to a biomolecule is small, the efficiency of energy transfer is high (high FRET), but when the distance between the fluorophores is large, the efficiency of energy transfer is low (low FRET) (green ball, donor; red ball, acceptor; black squiggle, biomolecule). glucose + O2 + H2O H2O2 gluconic acid + ▇▇▇▇ ▇▇▇ + ½ O2

Trajectory Analysis. ‌ The endpoints, MH and QLQ, were treated as continuous variables and unsupervised trajectory clustering was performed by means of a modified k-means algorithm. Specifically, the kmlShape R package was used to cluster individual patient trajectories accounting for the shape of each trajectory using a shape-respecting distance metric. Options regarding the random initialization points and expectation–maximization were kept as default, while the time-slice was set to 0.01. Overall, kmlShape is a variant of k-means where the Fréchet distance, associated with trajectory shape, is used as the distance metric. The Fréchet distance is defined on a continuous interval, so that the real Fréchet distance cannot be obtained in discrete cases, but can be infinitely approximated. In brief, a curve P can be regarded as the mobile trajectory that travels at a speed α. Then, the Fréchet distance between the curve P and another Q considered as a mobile trajectory with speed β, is the smallest possible maximum distance between the two curves after reparameterization of P and Q by α and β, respectively: DistFrechet(P, Q) = dα,β(P, Q). With appropriate approximation, this distance can account for the different number or location of measurement points and missing values in patients. In the implementation of kmlShape, Fréchet distance is also used to determine the cluster centers. A known limitation of k-means algorithm is that the resulting clusters depend on the initial random assignments and, thus, each run with the same number of clusters k, might yield slightly different results. To mitigate this dependence, for each k value, we run the algorithm 10 times with different initial values so as to pick the best result in terms of within-cluster compactness. This was defined as the clustering solution with the lowest within-cluster sum of squares (WSS). The WSS is a commonly used measure of cluster compactness and is defined as the sum of distances between the points and the corresponding centroids for each cluster: