237 search results - page 2 / 48 » Practical and Optimal String Matching |
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
SPIRE
2010
Springer
14 years 8 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
VLDB
2004
ACM
15 years 2 months ago
2004
ACM
DIS
2006
Springer
15 years 1 months ago
2006
Springer
This paper introduces a new family of string classifiers based on local relatedness. We use three types of local relatedness measurements, namely, longest common substrings (LCStr&...
100
Voted
SIAMDM
1998
14 years 9 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...