@article{fd8b7133-4b0d-486e-a5d7-9428905bccaf,
author = {Artur Niewiarowski, Marek Stanuszek},
title = {Parallelization of the Levenshtein distance algorithm},
journal = {Czasopismo Techniczne},
volume = {2014},
number = {Nauki Podstawowe Zeszyt 3 NP (17) 2014},
year = {2015},
issn = {0011-4561},
pages = {109-112},keywords = {Levenshtein distance; Levenshtein-Damerau distance; edit distance; very large strings; parallel computing; threads; high performance computing; Microsoft .NET Framework 4.0; mono-project},
abstract = {This paper presents a method for the parallelization of the Levenshtein distance algorithm deployed on very large strings. The proposed approach was accomplished using .NET Framework 4.0 technology with a specific implementation of threads using the System. Threading.Task namespace library. The algorithms developed in this study were tested on a high performance machine using Xamarin Mono (for Linux RedHat/Fedora OS). The computational results demonstrate a high level of efficiency of the proposed parallelization procedure.},
doi = {10.4467/2353737XCT.14.319.3407},
url = {https://ejournals.eu/czasopismo/czasopismo-techniczne/artykul/parallelization-of-the-levenshtein-distance-algorithm}
}