10 search results - page 1 / 2 » Indexing Variable Length Substrings for Exact and Approximat... |
SPIRE
2009
Springer
13 years 11 months ago
2009
Springer
We introduce two new index structures based on the q-gram index. The new structures index substrings of variable length instead of q-grams of fixed length. For both of the new ind...
VLDB
2007
ACM
14 years 5 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 ...
SPIRE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
CPM
2000
Springer
13 years 9 months ago
2000
Springer
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
ICIP
1995
IEEE
14 years 6 months ago
1995
IEEE
Traditionally, Markov models have not been successfully used for compression of signal data other than binary image data. Due to the fact that exact substring matches in non-binar...