New Bit-Parallel Indel-Distance Algorithm.
Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings,
Lecture Notes in Computer Science Vol.3503, pp.380-390
(2005), [peer-reviewed]
Event Date:
May 10-13, 2005
Abstract / 概要
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…