10 search results - page 1 / 2 » Fast Bit-Vector Algorithms for Approximate String Matching U... |
SOFSEM
2005
Springer
14 years 10 months ago
2005
Springer
CPM
1998
Springer
14 years 9 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
SPIRE
2005
Springer
14 years 10 months ago
2005
Springer
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
IWOCA
2009
Springer
14 years 11 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
CPM
2005
Springer
14 years 10 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...