10 search results - page 1 / 2 » On-Line Approximate String Searching Algorithms: Survey and ... |
IJCM
2002
13 years 7 months ago
2002
CPM
2008
Springer
13 years 9 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
GBRPR
2007
Springer
13 years 11 months ago
2007
Springer
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
CPM
1999
Springer
13 years 11 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...