122 search results - page 1 / 25 » Vector Algorithms for Approximate String Matching |
IJFCS
2002
13 years 10 months ago
2002
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...
CPM
1998
Springer
14 years 3 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...
SOFSEM
2005
Springer
14 years 4 months ago
2005
Springer
ICCSA
2010
Springer
14 years 5 months ago
2010
Springer
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...
ISAAC
2001
Springer
14 years 3 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...