160 search results - page 6 / 32 » Improved Single and Multiple Approximate String Matching |
CPM
1998
Springer
13 years 11 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
CIKM
1997
Springer
13 years 11 months ago
1997
Springer
As more online databases are integrated into digital libraries, the issue of quality control of the data becomes increasingly important, especially as it relates to the effective ...
ISPAN
1997
IEEE
13 years 11 months ago
1997
IEEE
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
ITIIS
2010
13 years 1 months ago
2010
Rapid growth of internet applications has increased the importance of intrusion detection system (IDS) performance. String matching is the most computation-consuming task in IDS. ...
DEBU
2010
13 years 6 months ago
2010
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...