318 search results - page 8 / 64 » A New Indexing Method for Approximate String Matching |
ICPR
2002
IEEE
15 years 10 months ago
2002
IEEE
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
JDA
2008
14 years 9 months ago
2008
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
PR
1998
14 years 9 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...
81
Voted
ICALP
2005
Springer
15 years 2 months ago
2005
Springer
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
BIRTHDAY
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. We present a method to speed up approximate string matching by mapping the factual alphabet to a smaller alphabet. We apply the alphabet reduction scheme to a tuned versi...