6 search results - page 1 / 2 » Matching a Set of Strings with Variable Length Don't Cares |
CPM
1995
Springer
13 years 9 months ago
1995
Springer
DIS
2008
Springer
13 years 7 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 ...
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 ...
SODA
2010
ACM
14 years 2 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, ...
TKDE
2008
13 years 5 months ago
2008
In this paper, a new symmetry-based genetic clustering algorithm is proposed which automatically evolves the number of clusters as well as the proper partitioning from a data set. ...