Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance.
SOFSEM 2005: Theory and Practice of Computer Science, 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings,
Lecture Notes in Computer Science Vol.3381, pp.380-384
(2005), [peer-reviewed]
Event Date:
January 22-28, 2005
Abstract / 概要
The approximate string matching problem is to find all locations at which a query p of length m matches a substring of a text t of length n with at most k differences (insertions, deletions, substitutions). The fastest solutions in practice for this problem are the…