A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
New Bit-Parallel Indel-Distance Algorithm
[chapter]
2005
Lecture Notes in Computer Science
The task of approximate string matching is to find all locations at which a pattern string p of length m matches a substring of a text string t of length n with at most k differences. It is common to use Levenshtein distance [5] , which allows the differences to be single-character insertions, deletions, substitutions. Recently, in [3] , the IndelMYE, In-delWM and IndelBYN algorithms where introduced as modified version of the bit-parallel algorithms of Myers [6], Wu&Manber [10] and
doi:10.1007/11427186_33
fatcat:q2puyzdrljg3bmztlhhbwdcvu4