A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm

Given two strings X (|X|=m) and Y (|Y|=n) over an alphabet Σ, the edit distance between X and Y can be computed in O(mn/t) time with the help of the Four-Russians' lookup table whose block size is t. The Four-Russians' lookup table can be constructed in O((3|Σ|)2tt2) time using O((3|Σ|)2tt...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 656; pp. 173 - 179
Main Authors:	Kim, Youngho, Na, Joong Chae, Park, Heejin, Sim, Jeong Seop
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 20.12.2016
Subjects:	Approximate string matching Edit distance Four-Russians' algorithm Parallelization Edit distance Approximate string matching Four-Russians' algorithm Parallelization
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!