62 search results - page 1 / 13 » Optimizing the cost matrix for approximate string matching u... |
PR
1998
13 years 4 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
CPM
1998
Springer
13 years 8 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...
IPPS
2006
IEEE
13 years 10 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
ALGORITHMICA
2005
13 years 4 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
RSA
2002
13 years 4 months ago
2002
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...