{'fraction_non_alphanumeric': 0.021739130434782608, 'fraction_numerical': 0.0, 'mean_word_length': 5.5, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 1, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Adaptive settings for the nearest-neighbor particle tracking algorithm

BACKGROUND
The performance of the single particle tracking (SPT) nearest-neighbor algorithm is determined by parameters that need to be set according to the characteristics of the time series under study. Inhomogeneous systems, where these characteristics fluctuate spatially, are poorly tracked when parameters are set globally.


RESULTS
We present a novel SPT approach that adapts the well-known nearest-neighbor tracking algorithm to the local density of particles to overcome the problems of inhomogeneity.


CONCLUSIONS
We demonstrate the performance improvement provided by the proposed method using numerical simulations and experimental data and compare its performance with state of the art SPT algorithms.


AVAILABILITY AND IMPLEMENTATION
The algorithms proposed here, are released under the GNU General Public License and are freely available on the web at http://sourceforge.net/p/adaptivespt.


CONTACT
javier.mazzaferri@gmail.com


SUPPLEMENTARY INFORMATION
Supplementary data are available at Bioinformatics online.