PL EN


Preferences help
enabled [disable] Abstract
Number of results
- |
Article title

Parallelization of the Levenshtein distance algorithm

Content
Title variants
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.
Publisher
Year
-
Physical description
Dates
online
2015-04-09
Contributors
References
Document Type
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.ojs-nameId-6e3e8ea9-5a94-37a7-828b-e6cd5da23db6-year-2015-article-1605
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.