96 search results - page 2 / 20 » Improved Algorithms for Approximate String Matching (Extende... |
187
Voted
VLDB
2007
ACM
16 years 1 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
97
Voted
ICDAR
1999
IEEE
15 years 5 months ago
1999
IEEE
Abstract
141
Voted
CPM
2005
Springer
15 years 6 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...
138
Voted
ASAP
2004
IEEE
15 years 4 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
159
Voted
CPM
1998
Springer
15 years 5 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...