132 search results - page 4 / 27 » A Linear Size Index for Approximate Pattern Matching |
LATIN
1998
Springer
13 years 11 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
CPM
2000
Springer
13 years 11 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...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
Abstract. Partial-match queries return data items that contain a subset of the query keywords and order the results based on the statistical properties of the matched keywords. The...
FCT
2005
Springer
14 years 28 days ago
2005
Springer
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...
LATIN
1998
Springer
13 years 11 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...