Parallelization of the Levenshtein distance algorithm

• Authors: Artur Niewiarowski , Marek Stanuszek
• Languages of publication: PL

Abstracts

PL

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.

Keywords

PL

Levenshtein distance, Levenshtein-Damerau distance, edit distance, very large strings, parallel computing, threads, high performance computing, Microsoft .NET Framework 4.0, mono-project

• Publisher: [unknown2]
• Journal: Czasopismo Techniczne
• Year: -

Dates

online

2015-04-09

Contributors

author

Artur Niewiarowski

author

Marek Stanuszek