NobleBlocks

Research indexJournal article

Distributed Algorithm for Parallel Edit Distance Computation

Sadiq, Yousaf

Computing and Informatics1 Jan 2020Open access

DOI10.31577/cai_2020_4_757

Free to read at the publisher

You can read the abstract here, or the full text at the publisher.

Read at the publisher

Abstract

The edit distance is the measure that quantifies the difference between two strings. It is an important concept because it has its usage in many domains such as natural language processing, spell checking, genome matching, and pattern recognition. Edit distance is also known as Levenshtein distance. Sequentially, the edit distance is computed by using dynamic programming based strategy that may not provide results in reasonable time when input strings are large. In this work, a distributed algorithm is presented for parallel edit distance computation. The proposed algorithm is both time and space efficient. It is evaluated on a hybrid setup of distributed and shared memory systems. Results suggest that the proposed algorithm achieves significant performance gain over the existing parallel approach.

Discussion

Citations

Topics

More

Suggest a correction or report