2014
DOI: 10.1093/bioinformatics/btu793
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive settings for the nearest-neighbor particle tracking algorithm

Abstract: Supplementary data are available at Bioinformatics online.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
19
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(19 citation statements)
references
References 20 publications
0
19
0
Order By: Relevance
“…As the last step of our single cell tracking algorithm, nearest neighbor detection was implemented as a common technique for the reconstruction of single cell trajectories (Fig. S3 ) 27 , 34 in time series of 3D volumes. Nearest neighbor methods are sufficient to reconstruct cell trajectories if the time span between two consecutive time steps is small enough, so that overlapping cell area or a small migrating distance are guaranteed.…”
Section: Resultsmentioning
confidence: 99%
“…As the last step of our single cell tracking algorithm, nearest neighbor detection was implemented as a common technique for the reconstruction of single cell trajectories (Fig. S3 ) 27 , 34 in time series of 3D volumes. Nearest neighbor methods are sufficient to reconstruct cell trajectories if the time span between two consecutive time steps is small enough, so that overlapping cell area or a small migrating distance are guaranteed.…”
Section: Resultsmentioning
confidence: 99%
“…Cell tracking was done using a method that dynamically adapts to local cell density 37 . On average, we detected 148,580 trajectory steps per experiment (Supplementary Table SI).…”
Section: Resultsmentioning
confidence: 99%
“…We defined the position of a cell at the highest peak within each region above a threshold 70 . For cell tracking, we employed an algorithm developed in-house 37 .…”
Section: Methodsmentioning
confidence: 99%
“…Variations of a nearest-neighbor algorithm can be found in the literature, including modified features adapted to work under conditions in which the original algorithm can fail to track a single or multiple objects correctly, e.g., to study single-molecule trajectories . In addition, computational strategies have been proposed and employed for solving problems of particle tracking in complex systems, using an adaptive particle search, based in the local particle density . More complex algorithms were also developed, with a search radius accounting for the local particle density, as well as a motion-based search radius .…”
Section: Introductionmentioning
confidence: 99%