Sciweavers

12 search results - page 1 / 3
» String Matching with Variable Length Gaps
Sort
View
SPIRE
2010
Springer
13 years 4 months ago
String Matching with Variable Length Gaps
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...
Philip Bille, Inge Li Gørtz, Hjalte Wedel V...
SODA
2010
ACM
213views Algorithms» more  SODA 2010»
14 years 3 months ago
Regular Expression Matching with Multi-Strings
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, ...
Philip Bille, Mikkel Thorup
VLDB
2007
ACM
107views Database» more  VLDB 2007»
14 years 6 months ago
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams
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 ...
Chen Li, Bin Wang, Xiaochun Yang
CPM
1995
Springer
93views Combinatorics» more  CPM 1995»
13 years 10 months ago
Matching a Set of Strings with Variable Length Don't Cares
Gregory Kucherov, Michaël Rusinowitch
DIS
2008
Springer
13 years 8 months ago
String Kernels Based on Variable-Length-Don't-Care Patterns
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 ...
Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shu...