514 search results - page 6 / 103 » Approximate Periods of Strings |
CPM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
GBRPR
2007
Springer
13 years 11 months ago
2007
Springer
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
ALENEX
2007
13 years 9 months ago
2007
We introduce a new filtering method for approximate string matching called the suffix filter. It has some similarity with well-known filtration algorithms, which we call factor...