12 search results - page 1 / 3 » String Matching with Variable Length Gaps |
SPIRE
2010
Springer
14 years 8 months ago
2010
Springer
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
121
Voted
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
159
click to vote
VLDB
2007
ACM
15 years 10 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 ...
CPM
1995
Springer
15 years 1 months ago
1995
Springer
100
click to vote
DIS
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. We propose a new string kernel based on variable-lengthdon't-care patterns (VLDC patterns). A VLDC pattern is an element of ({}) , where is an alphabet and is the ...